Results on the Improved Decoding Algorithm for Low-Density Parity-Check Codes Over the Binary Erasure Channel

DOI10.1109/TIT.2007.892812MaRDI QIDQ3548897zbMATH OpenFDO

Authors Badri N. Vellambi, Faramarz Fekri

Publication date 21 December 2008

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

Mathematics Subject Classification ID

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

Recommendations

• On Decoding of Low-Density Parity-Check Codes Over the Binary Erasure Channel
• Finite-length analysis of low-density parity-check codes on the binary erasure channel
• scientific article; zbMATH DE number 4216926
• Improved Bit-Flipping Decoding of Low-Density Parity-Check Codes
• Effect of one redundant parity-check equation on the stopping distance

Cited in

(8)

• A Finite-Length Algorithm for LDPC Codes Without Repeated Edges on the Binary Erasure Channel
• On Decoding of Low-Density Parity-Check Codes Over the Binary Erasure Channel
• Improved BP-based decoding algorithms integrated with GA for LDPC codes
• Decoding algorithm of low-density parity-check codes based on Bowman-Levin approximation
• Improved Bit-Flipping Decoding of Low-Density Parity-Check Codes
• Results on Punctured Low-Density Parity-Check Codes and Improved Iterative Decoding Techniques
• Effect of one redundant parity-check equation on the stopping distance
• scientific article; zbMATH DE number 5260071 (Why is no real title available?)

This page was built for publication: Results on the Improved Decoding Algorithm for Low-Density Parity-Check 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 Q3548897)