Efficient encoding of low-density parity-check codes

DOI10.1109/18.910579zbMath1021.94009OpenAlexW2140655888MaRDI QIDQ4544511

Ruediger Urbanke, Thomas J. Richardson

Publication date: 4 August 2002

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

Full work available at URL: https://semanticscholar.org/paper/1ab6692caf7cc6b25e27fb59531c3a193c80d032

zbMATH Keywords

random graphssparse matricesencodinglow-density parity-check codesbinary erasure channelturbo codesparity check

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of graph theory (05C90) Other types of codes (94B60) Decoding (94B35) Channel models (including quantum) in information and communication theory (94A40) Source coding (94A29)

Related Items (11)

Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes ⋮ Improving a power line communications standard with LDPC codes ⋮ Distributed source coding techniques for lossless compression of hyperspectral images ⋮ QKD iterative information reconciliation based on LDPC codes ⋮ Theory behind quantum error correcting codes: an overview ⋮ Super-simple \((v, 5, 2)\) directed designs and their smallest defining sets with application in LDPC codes ⋮ A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes ⋮ Statistical mechanics and capacity-approaching error-correcting codes ⋮ Theory and applications of Raptor codes ⋮ High-throughput architectures for circular block-type low-density parity-check codes ⋮ LDPC codes from Singer cycles

Uses Software

• LDPC

This page was built for publication: Efficient encoding of low-density parity-check codes