Low-complexity error correction of Hamming-code-based LDPC codes
Publikation/Tidskrift/Serie: Problems of Information Transmission
Förlag: Maik Nauka/Interperiodica/Springer
Ensembles of binary random LDPC block codes constructed using Hamming codes as constituent codes are studied for communicating over the binary symmetric channel. These ensembles are known to contain codes that asymptotically almost meet the Gilbert-Varshamov bound. It is shown that in these ensembles there exist codes which can correct a number of errors that grows linearly with the code length, when decoded with a low-complexity iterative decoder, which requires a number of iterations that is a logarithmic function of the code length. The results are supported by numerical examples, for various choices of the code parameters.
- Technology and Engineering
- Electromagnetic theory
- Information Theory
- ISSN: 0032-9460