On the computation of the minimum distance of low-density parity-check codes

作者: Xiao-Yu Hu , M.P.C. Fossorier , E. Eleftheriou

DOI: 10.1109/ICC.2004.1312605

关键词: Low-density parity-check codeBlock codeLinear codeDecoding methodsLocally decodable codeTurbo codeDiscrete mathematicsCombinatoricsMathematicsList decodingConcatenated error correction code

摘要: … broader-sense definition are linear codes whose parity-check … of the list decoder to trap minimum-weight nonzero codewords. … reliability-based (IRB) decoding algorithm [24]. The IRB …

参考文章(34)
Tom Richardson, Error Floors of LDPC Codes ,(2003)
David J. C. MacKay, Radford M. Neal, Good Codes Based on Very Sparse Matrices Proceedings of the 5th IMA Conference on Cryptography and Coding. pp. 100- 111 ,(1995) , 10.1007/3-540-60693-9_13
Pascal O. Vontobel, Algebraic coding for iterative decoding Series in signal and information processing. ,vol. 011, ,(2003) , 10.3929/ETHZ-A-004567465
Hassan Masum, Review of Algorithmics for hard problems ACM SIGACT News. ,vol. 34, pp. 6- 8 ,(2003) , 10.1145/882116.882121
Yongyi Mao, A.H. Banihashemi, A heuristic search for good low-density parity-check codes at short block lengths international conference on communications. ,vol. 1, pp. 41- 44 ,(2001) , 10.1109/ICC.2001.936269
Xiao-Yu Hu, E. Eleftheriou, D.M. Arnold, Regular and irregular progressive edge-growth tanner graphs IEEE Transactions on Information Theory. ,vol. 51, pp. 386- 398 ,(2005) , 10.1109/TIT.2004.839541
David J.C. MacKay, Michael S. Postol, Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes Electronic Notes in Theoretical Computer Science. ,vol. 74, pp. 97- 104 ,(2003) , 10.1016/S1571-0661(04)80768-0
E. Berlekamp, R. McEliece, H. van Tilborg, On the inherent intractability of certain coding problems (Corresp.) IEEE Transactions on Information Theory. ,vol. 24, pp. 384- 386 ,(1978) , 10.1109/TIT.1978.1055873