Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel

DOI10.1134/S0032946006020049zbMATH Open1237.94142OpenAlexW2035052782MaRDI QIDQ415651FDOQ415651

Authors: D. K. Zigangirov, Kamil S. Zigangirov 

Publication date: 9 May 2012

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946006020049

Recommendations

• Erasure correction by low-density codes
• On the error-correcting capability of LDPC codes
• On Decoding of Low-Density Parity-Check Codes Over the Binary Erasure Channel
• scientific article; zbMATH DE number 4216926
• Iterative decoding of LDPC codes: some bounds and properties

Mathematics Subject Classification ID

Decoding (94B35)

Cites Work

• Title not available (Why is that?)
• Efficient erasure correcting codes
• Title not available (Why is that?)
• On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices
• An analysis of the block error probability performance of iterative decoding
• Title not available (Why is that?)

Cited In (4)

• Composition of Low-Error 2-Query PCPs Using Decodable PCPs
• On the error-correcting capability of LDPC codes
• Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes
• Erasure correction by low-density codes

This page was built for publication: Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel

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