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.885443zbMath1309.94179MaRDI QIDQ3548125

Michael Mitzenmacher

Publication date: 21 December 2008

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

Mathematics Subject Classification ID

94B35: Decoding

94A24: Coding theorems (Shannon theory)