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

DOI10.1134/S0032946006020049zbMath1237.94142OpenAlexW2035052782MaRDI QIDQ415651

K. Sh. Zigangirov, D. K. 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

Mathematics Subject Classification ID

Decoding (94B35)

Related Items (2)

On the error-correcting capability of LDPC codes ⋮ Erasure correction by low-density codes

Cites Work

• 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
• Efficient erasure correcting codes
• Unnamed Item
• Unnamed Item
• Unnamed Item

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