Low-complexity error correction of Hamming-code-based LDPC codes

DOI10.1134/S0032946009020021zbMath1173.94451OpenAlexW2005606852MaRDI QIDQ734298

M. Lončar, V. A. Zyablov, Rolf Johannesson

Publication date: 20 October 2009

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946009020021

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (2)

On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\) ⋮ Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes

Cites Work

• Unnamed Item
• Unnamed Item
• Asymptotically optimal switching circuits
• On codes from hypergraphs.
• Expander codes
• A recursive approach to low complexity codes
• On expander codes
• Error exponents of expander codes
• Mathematical analysis of an iterative decoding algorithm for low-density codes

This page was built for publication: Low-complexity error correction of Hamming-code-based LDPC codes