Construction D$^\prime$ Lattices from Quasi-Cyclic Low-Density Parity-Check Codes
Siyu Chen, Brian M. Kurkoski, Eirik Rosnes

TL;DR
This paper introduces a new Construction D' lattice using binary QC-LDPC codes and product codes, achieving high coding gain and competitive error performance on AWGN channels.
Contribution
It presents a novel Construction D' lattice based on QC-LDPC codes and product codes, with improved minimum distance and error-rate performance.
Findings
High lattice coding gain achieved
Competitive error-rate performance on AWGN channel
Utilizes IEEE 802.16e QC-LDPC codes
Abstract
Recently, Branco da Silva and Silva described an efficient encoding and decoding algorithm for Construction D lattices. Using their algorithm, we propose a Construction D lattice based on binary quasi-cyclic low-density parity-check (QC-LPDC) codes and single parity-check product codes. The underlying codes designed by the balanced-distances rule contribute in a balanced manner to the squared minimum distance of the constructed lattice, which results in a high lattice coding gain. The proposed lattice based on IEEE 802.16e QC-LDPC codes is shown to provide competitive error-rate performance on the power-unconstrained additive white Gaussian noise channel.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Rings, Modules, and Algebras · Cryptography and Data Security
