Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 4 Oct 2018 in cs.IT and math.IT | (1810.02163v1)

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.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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.