Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform so well over the BEC

R. M. Tanner, “Error-correcting coding system,” Oct. 1981, U.S. Patent # \# 4,295,218

1981

Earlier work this paper cites.

——, “Convolutional codes from quasi-cyclic codes: a link between the theories of block and convolutional codes,” University of California, Santa Cruz, Tech Report UCSC-CRL-87-21, Nov. 1987

1987

Earlier work this paper cites.

M. Luby, M. Mitzenmacher, A. Shokrollahi, D. A. Spielman, and V. Stemann, “Practical loss-resilient codes,” in Proc. of the 29th annual ACM Symposium on Theory of Computing , 1997, pp. 150–159

1997

Earlier work this paper cites.

A. J. Felström and K. S. Zigangirov, “Time-varying periodic convolutional codes with low-density parity-check matrix,” IEEE Trans. Inform. Theory , vol. 45, no. 5, pp. 2181–2190, Sept. 1999

1999

Earlier work this paper cites.

K. Engdahl and K. S. Zigangirov, “On the theory of low density convolutional codes I,” Problemy Peredachi Informatsii , vol. 35, no. 4, pp. 295–310, 1999

1999

Earlier work this paper cites.

K. Engdahl, M. Lentmaier, and K. S. Zigangirov, “On the theory of low-density convolutional codes,” in AAECC-13: Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes . London, UK: Springer-Verlag, 1999, pp. 77–86

1999

Earlier work this paper cites.

M. Lentmaier, D. V. Truhachev, and K. S. Zigangirov, “To the theory of low-density convolutional codes. II,” Probl. Inf. Transm. , vol. 37, no. 4, pp. 288–306, 2001

2001

Earlier work this paper cites.

T. Richardson and R. Urbanke, “Multi-edge type LDPC codes,” 2002, presented at the Workshop honoring Prof. Bob McEliece on his 60th birthday, Caltech, USA

2002

Earlier work this paper cites.

J. Thorpe, “Low-density parity-check (LDPC) codes constructed from protographs,” Aug. 2003, Jet Propulsion Laboratory, INP Progress Report 42-154

2003

Earlier work this paper cites.

C. Méasson, A. Montanari, T. Richardson, and R. Urbanke, “Life above threshold: From list decoding to area theorem and MSE,” in Proc. of the IEEE Inform. Theory Workshop , San Antonio, TX, USA, Oct. 2004, e-print: cs.IT/0410028

2004

Cited alongside, same era.

R. M. Tanner, D. Sridhara, A. Sridharan, T. E. Fuja, and D. J. Costello, Jr., “LDPC block and convolutional codes based on circulant matrices,” IEEE Trans. Inform. Theory , vol. 50, no. 12, pp. 2966 – 2984, Dec. 2004

2004

Cited alongside, same era.

A. Sridharan, M. Lentmaier, D. J. Costello, Jr., and K. S. Zigangirov, “Convergence analysis of a class of LDPC convolutional codes for the erasure channel,” in Proc. of the Allerton Conf. on Commun., Control, and Computing , Monticello, IL, USA, Oct. 2004

2004

Cited alongside, same era.

——, “Terminated LDPC convolutional codes with thresholds close to capacity,” in Proc. of the IEEE Int. Symposium on Inform. Theory , Adelaide, Australia, Sept. 2005

2005

Cited alongside, same era.

M. Lentmaier, G. P. Fettweis, K. S. Zigangirov, and D. J. Costello, Jr., “Approaching capacity with asymptotically regular LDPC codes,” in Information Theory and Applications , San Diego, USA, Feb. 8–Feb. 13, 2009, pp. 173–177

2009

Later among the works it cites.

——, “Pseudocodeword performance analysis for LDPC convolutional codes,” IEEE Trans. Inform. Theory , vol. 55, no. 6, pp. 2577–2598, June 2009

2009

Later among the works it cites.

C. Méasson, A. Montanari, T. Richardson, and R. Urbanke, “The generalized area theorem and some of its consequences,” IEEE Trans. Inform. Theory , vol. 55, no. 11, pp. 4793–4821, Nov. 2009

2009

Later among the works it cites.

M. Lentmaier, A. Sridharan, K. S. Zigangirov, and D. J. Costello, Jr., “Iterative decoding threshold analysis for LDPC convolutional codes,” IEEE Trans. Info. Theory , Oct. 2010

2010

Closest in time.