Polynomial Time Low-Density Parity-Check Codes With Rates Very Close to the Capacity of the $q$-ary Random Deletion Channel for Large $q$

DOI10.1109/TIT.2006.885443zbMATH Open1309.94179OpenAlexW2120569398MaRDI QIDQ3548125

Michael Mitzenmacher

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

Mathematics Subject Classification ID

Decoding (94B35) Coding theorems (Shannon theory) (94A24)

Related Items (1)

Polynomial Time Decodable Codes for the Binary Deletion Channel

This page was built for publication: Polynomial Time Low-Density Parity-Check Codes With Rates Very Close to the Capacity of the $q$-ary Random Deletion Channel for Large $q$