Complexity Versus Performance of Capacity-Achieving Irregular Repeat–Accumulate Codes on the Binary Erasure Channel

DOI10.1109/TIT.2004.828101zbMath1303.94034OpenAlexW2022381080MaRDI QIDQ3547590

Igal Sason, Ruediger Urbanke

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.2004.828101

zbMATH Keywords

complexitydecodingcodeschannel capacityerasure channeldensity evolutionlow-density parity-checkirregular repeat-accumulatemessage-passing iterative

Mathematics Subject Classification ID

Cyclic codes (94B15) Error probability in coding theory (94B70) Coding theorems (Shannon theory) (94A24) Rate-distortion theory in information and communication theory (94A34)

Related Items (1)

Achievable complexity-performance tradeoffs in lossy compression

This page was built for publication: Complexity Versus Performance of Capacity-Achieving Irregular Repeat–Accumulate Codes on the Binary Erasure Channel