pith. sign in

arxiv: 1810.02163 · v1 · pith:5BV5YCI4new · submitted 2018-10-04 · 💻 cs.IT · math.IT

Construction D^prime Lattices from Quasi-Cyclic Low-Density Parity-Check Codes

classification 💻 cs.IT math.IT
keywords codeslatticeconstructionparity-checkprimealgorithmlatticeslow-density
0
0 comments X
read the original abstract

Recently, Branco da Silva and Silva described an efficient encoding and decoding algorithm for Construction D$^\prime$ lattices. Using their algorithm, we propose a Construction D$^\prime$ 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.