An Efficient Maximum-Likelihood Decoding of LDPC Codes Over the Binary Erasure Channel

DOI10.1109/TIT.2004.836694MaRDI QIDQ3546625zbMATH OpenFDO

Authors David Burshtein, Gadi Miller

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

zbMATH Keywords

Binary erasure channel (BEC)Iterative decodingLow-density parity-check (LDPC) codesMaximum likelihood (ML) decoding

Mathematics Subject Classification ID

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

Cited in

(5)

• Threshold Saturation for Nonbinary SC-LDPC Codes on the Binary Erasure Channel
• An Efficient Combined Bit-Flipping and Stochastic LDPC Decoder Using Improved Probability Tracers
• Composite scheme LR+Th for decoding with erasures and its effective equivalence to Forney's rule
• A Finite-Length Algorithm for LDPC Codes Without Repeated Edges on the Binary Erasure Channel
• A fast BER evaluation method for LDGM codes

This page was built for publication: An Efficient Maximum-Likelihood Decoding of LDPC Codes Over the Binary Erasure Channel

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