Technical Program

Paper Detail

Paper IDC.10.5
Paper Title Lattice Construction C* from Self-Dual Codes
Authors Maiara Francine Bollauf, Sueli Irene Rodrigues Costa, University of Campinas, Brazil; Ram Zamir, Tel Aviv University, Israel
Session C.10: Topics in Coding Theory
Presentation Lecture
Track Coding for Communications
Manuscript  Click here to download the manuscript
Virtual Presentation  Click here to watch in the Virtual Symposium
Abstract Construction C* was recently introduced as a generalization of the multilevel Construction C (or Forney’s code-formula), such that the coded levels may be dependent. Both constructions do not produce a lattice in general, hence the central idea of this paper is to present a 3-level lattice Construction C* scheme that admits an efficient nearest-neighborhood decoding. In order to achieve this objective, we choose coupled codes for levels 1 and 3 and set the second level code C2 as an independent linear binary self-dual code, which is known to have a rich mathematical structure among families of linear codes. Our main result states a necessary and sufficient condition for this construction to generate a lattice. We then present examples of efficient lattices and also non-lattice constellations with good packing properties.

Plan Ahead


2021 IEEE International Symposium on Information Theory

11-16 July 2021 | Melbourne, Victoria, Australia

Visit Website!