Low-Density Parity-Check Lattices: Construction and Decoding Analysis

DOI10.1109/TIT.2006.881720MaRDI QIDQ3548107zbMATH OpenFDO

Authors Mohammad-Reza Sadeghi, Amir H. Banihashemi, Daniel Panario

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2006.881720

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35)

Recommendations

• Low-density parity-check codes based on finite geometries: a rediscovery and new results
• Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
• scientific article; zbMATH DE number 2063211
• Low-Density Lattice Codes
• The construction of low-density parity-check codes based on protograph

Cited in

(9)

• Bounds for the \(l_1\)-distance of \(q\)-ary lattices obtained via constructions \(\mathrm D\), \(\mathrm D'\) and \(\overline{\mathrm D}\)
• Lattices from codes over \(\mathbb {Z}_q\): generalization of constructions \(D\), \(D'\) and \(\overline{D}\)
• Lattice and construction of high coding gain lattices from codes
• Low-Density Lattice Codes
• Connections between Construction D and related constructions of lattices
• Low-density parity-check codes based on finite geometries: a rediscovery and new results
• Multilevel LDPC Lattices With Efficient Encoding and Decoding and a Generalization of Construction $\text{D}'$
• Linear label code of a root lattice using Gröbner bases
• On lattice constructions D and D^ from q-ary linear codes

This page was built for publication: Low-Density Parity-Check Lattices: Construction and Decoding Analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548107)