Author:
Hollmann Henk D.L.,Tolhuizen Ludo M.G.M.
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference6 articles.
1. Finite-length analysis of low-density parity-check codes on the binary erasure channel;Di;IEEE Trans. Inform. Theory,2002
2. J.H. Weber, K.A.S. Abdel-Ghaffar, Stopping set analysis for hamming codes, in: M.J. Dinneen (Ed.), Proc. IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, Rotorua, New Zealand, August 29–September 1, ISBN 7803-9481-X, 2005, pp. 244–247
3. M. Schwartz, A. Vardy, On the stopping distance and the stopping redundancy of codes, in: Proc. 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, 4–9 September, 2005, pp. 975–979
4. On the stopping distance and the stopping redundancy of codes;Schwartz;IEEE Trans. Inform. Theory,2006
5. H.D.L. Hollmann, L.M.G.M. Tolhuizen, On parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size, IEEE Trans. Inform. Theory, submitted for publication, see also arXiv: cs.IT/0507068
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献