www.PseudoCodewords.info

Papers on Stopping Sets, Near-Codewords, Instantons, etc.

This page lists papers on stopping sets, near-codewords, instantons, trapping sets, and absorbing sets. Note that the assignment of a paper to a certain category is not always clear-cut and sometimes arbitrary.

Any suggestions for additions to this page are highly welcome. Please send an email to Pascal Vontobel [email: firstname dot lastname at hp dot com]. Thank you!

2008

T. Wadayama
Average stopping set weight distributions of redundant random ensembles [ieeexplore]
IEEE Trans. Inform. Theory, vol. 54, no. 11, pp. 4991-5004, Nov. 2008.

M. Ivkovic, S.K. Chilappagari, and B. Vasic
Eliminating trapping sets in low-density parity check codes by using Tanner graph covers [ieeexplore]
IEEE Trans on Inf. Theory, vol. 54, no. 8, pp. 3763-3768, Aug. 2008.

P. Lee, L. Dolecek, Z. Zhang, V. Anantharam, B. Nikolic, and M.J. Wainwright
Error floors in LDPC codes: fast simulation, bounds and hardware emulation [ieeexplore]
Proc. IEEE Intern. Symp. Inform. Theory, Toronto, Canada, pp. 444-448, July 6-11, 2008.

G. Sridharan, A. Kumarasubramanian, A. Thangaraj, and S. Bhashyam
Optimizing burst erasure correction of LDPC codes by interleaving [ieeexplore]
Proc. IEEE Intern. Symp. Inform. Theory, Toronto, Canada, pp. 1143-1147, July 6-11, 2008.

V. Rathi
Conditional entropy of non-binary LDPC codes over the BEC [ieeexplore]
Proc. IEEE Intern. Symp. Inform. Theory, Toronto, Canada, pp. 945-949, July 6-11, 2008.

M. Hirotomo, Y. Konishi, and M. Morii
On the probabilistic computation algorithm for the minimum-size stopping sets of LDPC codes [ieeexplore]
Proc. IEEE Intern. Symp. Inform. Theory, Toronto, Canada, pp. 295-299, July 6-11, 2008.

J. Han and P.H. Siegel
On ML redundancy of codes [ieeexplore]
Proc. IEEE Intern. Symp. Inform. Theory, Toronto, Canada, pp. 280-284, July 6-11, 2008.

K.A.S. Abdel-Ghaffar and J.H. Weber
Separating erasures from errors for decoding [ieeexplore]
Proc. IEEE Intern. Symp. Inform. Theory, Toronto, Canada, pp. 215-219, July 6-11, 2008.

M. Hirotomo, Y. Konishi, and M. Morii
A probabilistic algorithm for finding the minimum-size stopping sets of LDPC codes [ieeexplore]
Proc. IEEE Information Theory Workshop, Porto, Portugal, pp. 66-70, May 5-9, 2008.

J.H. Weber and K.A.S. Abdel-Ghaffar
Results on parity-check matrices with optimal stopping and/or dead-end set enumerators [ieeexplore]
IEEE Trans. on Inform. Theory, vol. IT-54, pp. 1368-1374, March 2008.

S.K. Chilappagari, D.V. Nguyen, B. Vasic, and M.W. Marcellin
On the guaranteed error correction capability of LDPC codes [ieeexplore]
Proc. IEEE Intern. Symp. Inform. Theory, Toronto, Canada, pp. 434-438, July 6-11, 2008.

2007

Z. Zhang, L. Dolecek, V. Anantharam, M. Wainwright, and B. Nikolic,
Quantization effects in low-density parity-check decoders [not yet available]
to appear in Proc. ICC 2007, Glasgow, UK, June 2007.

L. Dolecek, Z. Zhang, V. Anantharam, M. Wainwright, and B. Nikolic,
Analysis of absorbing sets for array-based LDPC codes [not yet available]
to appear in Proc. ICC 2007, Glasgow, UK, June 2007.

O. Milenkovic, E. Soljanin, and P. Whiting
Asymptotic spectra of trapping sets in regular and irregular LDPC code ensembles [ieeexplore]
IEEE Trans. Inform. Theory, vol. 53, no. 1, pp. 39-55, Jan. 2007.

2006

Z. Zhang, L. Dolecek, B. Nikolic, V. Anantharam, and M. Wainwright
Investigation of error floors of a structured low-density parity-check code by hardware simulation [.pdf]
Proc. Globecom 2006, San Francisco, CA, USA, Nov. - Dec. 2006.

S.-T. Xia and F.-W. Fu
Stopping set distributions of some linear codes [ieeexplore]
IEEE Inform. Theory Workshop, Chengdu, China, pp. 47-51, Oct. 2006.

M. Stepanov and M. Chertkov
Instanton analysis of low-density parity-check codes in the error-floor regime [ieeexplore]
Proc. IEEE Intern. Symp. on Inform. Theory, Seattly, WA, USA, July 2006, pp. 552-556.

M. Chertkov and V.Y. Chernyak
Loop series for discrete statistical models on graphs [pdf]
J. Stat. Mech, 2006.

M. Chertkov and V.Y. Chernyak
Loop calculus in statistical physics and information science [pdf]
Phys. Rev. E 73.

S.-T. Xia and F.-W. Fu
On the minimum pseudo-codewords of LDPC codes [ieeexplore]
IEEE Comm. Letters, vol. 10, no. 5, pp. 363-365, May 2006.

2005

K.M. Krishnan and P. Shankar
On the complexity of finding stopping distance in Tanner graphs [arxiv]
submitted, 2005.

M. Zhu and K.M. Chugg
Lower bounds on stopping distance of linear codes and their applications [arxiv]
Proc. 43rd Allerton Conf. on Communications, Control, and Computing, Monticello, IL, USA, Sep. 28-30, 2005.

S. Laendner and O. Milenkovic
Algorithmic and combinatorial analysis of trapping sets in structured LDPC codes [arxiv]
Proc. WirelessCom, Hawaii, USA, Jun. 13-16, 2005.

O. Milenkovic, E. Soljanin, and P. Whiting
Asymptotic distributions of trapping sets in random regular LDPC code ensembles [arxiv]
Proc. 43rd Allerton Conf. on Communications, Control, and Computing, Monticello, IL, USA, Sep. 18-20, 2005.

A. Orlitsky, K. Viswananathan, and J. Zhang
Stopping set distribution of LDPC code ensembles [ieeexplore]
IEEE Trans. Inform. Theory, vol. IT-51, no. 3, pp. 929-953, Mar. 2005.

2004

V. Chernyak, M. Chertkov, M. Stepanov, and B Vasic,
Instanton method of post-error-correction analytical evaluation [ieeexplore]
Proc. IEEE Inform. Theory Workshop, San Antonio, TX, USA, Oct. 24-29, 2004, pp. 220-224.

2003

T. Richardson
Error floors of LDPC codes [arxiv]
Proc. 41st Allerton Conf. on Communications, Control, and Computing, Monticello, IL, USA, October 1-3, 2003.

D.J.C. MacKay and M.S. Postol
Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes [web]
Electronic Notes in Computer Science, 2003.

N. Kashyap and A. Vardy
Stopping sets in codes from designs,
Conference version: [ieeexplore] Long version (never submitted for publication): [.pdf]
Proc. IEEE Intern. Symp. Inform. Theory, Yokohama, Japan, p. 122, June 29 - July 4, 2003.

2002

C. Di, D. Proietti, T. Richardson, E. Telatar, and R. Urbanke
Finite length analysis of low-density parity-check codes on the binary erasure channel [ieeexplore]
IEEE Trans. Inform. Theory, vol. IT-48, no. 6, pp. 1570-1579, Jun. 2002.

T. Richardson, A. Shokrollahi, and R. Urbanke,
Finite-length analysis of various low-density parity-check ensembles for the binary erasure channel [ieeexplore]
Proc. IEEE International Symposium on Information Theory, Lausanne, Switzerland, p. 1, Jun. 30 - Jul. 5, 2002.

A. Orlitsky, R. Urbanke, K. Vishwanathan, and J. Zhang
Stopping sets and the girth of Tanner graphs [ieeexplore]
Proc. IEEE International Symposium on Information Theory, Lausanne, Switzerland, p. 2, Jun. 30 - Jul. 5, 2002.

---

Last Modified: Tuesday, 15-Sep-2009 02:33:54 PDT