On skew polynomial codes and lattices from quotients of cyclic division algebras
Abstract
We propose a variation of Construction A of lattices from linear codes defined using the quotient / p of some order inside a cyclic division F-algebra, for p a prime ideal of a number field F. To obtain codes over this quotient, we first give an isomorphism between / p and a ring of skew polynomials. We then discuss definitions and basic properties of skew polynomial codes, which are needed for Construction A, but also explore further properties of the dual of such codes. We conclude by providing an application to space-time coding, which is the original motivation to consider cyclic division F-algebras as a starting point for this variation of Construction A.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.