• DocumentCode
    3125884
  • Title

    Construction of Barnes-Wall lattices from linear codes over rings

  • Author

    Harshan, J. ; Viterbo, Emanuele ; Belfiore, J.-C.

  • Author_Institution
    Dept. of ECSE, Monash Univ., Clayton, VIC, Australia
  • fYear
    2012
  • fDate
    1-6 July 2012
  • Firstpage
    3110
  • Lastpage
    3114
  • Abstract
    Dense lattice packings can be obtained via the well-known Construction A from binary linear codes. In this paper, we use an extension of Construction A called Construction A´ to obtain Barnes-Wall lattices from linear codes over polynomials rings. To obtain the Barnes-Wall lattice BW2m in C2m for any m ≥ 1, we first identify a linear code C2m over the quotient ring Um = F2[u]/um and then propose a mapping ψ : Um → Z[i] such that the code L2m = ψ (C2m) is a lattice constellation. Further, we show that L2m has the cubic shaping property when m is even. Finally, we show that BW2m can be obtained through Construction A´ as BW2m = (1 + i)m Z[i]2m ⊕ L2m.
  • Keywords
    binary codes; block codes; linear codes; polynomials; Barnes-wall lattices construction; binary linear codes; cubic shaping property; dense lattice packings; lattice constellation; linear block codes; polynomial ring; quotient ring; Constellation diagram; Generators; Lattices; Linear code; Polynomials; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
  • Conference_Location
    Cambridge, MA
  • ISSN
    2157-8095
  • Print_ISBN
    978-1-4673-2580-6
  • Electronic_ISBN
    2157-8095
  • Type

    conf

  • DOI
    10.1109/ISIT.2012.6284136
  • Filename
    6284136