Papers
Topics
Authors
Recent
Search
2000 character limit reached

On skew polynomial codes and lattices from quotients of cyclic division algebras

Published 19 Jun 2015 in cs.IT, math.IT, and math.RA | (1506.06079v1)

Abstract: We propose a variation of Construction A of lattices from linear codes defined using the quotient $\Lambda/\mathfrak p\Lambda$ of some order $\Lambda$ inside a cyclic division $F$-algebra, for $\mathfrak p$ a prime ideal of a number field $F$. To obtain codes over this quotient, we first give an isomorphism between $\Lambda/\mathfrak p\Lambda$ 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.

Citations (16)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.