Fetching the paper…
Reading the bibliography…
Spatially coupled low-density parity-check codes show an outstanding performance under the low-complexity belief propagation (BP) decoding algorithm.
A. J. Felström and K. S. Zigangirov, “Time-varying periodic convolutional codes with low density parity check matrix,”
1999
Earlier work this paper cites.
M. Lentmaier, A. Sridharan, K. S. Zigangirov, and D. J. Costello, “Terminated LDPC convolutional codes with thresholds close to capacity,” in
2005
Earlier work this paper cites.
N. Macris, “Griffith–Kelly–Sherman correlation inequalities: A useful tool in the theory of error correcting codes,”
2007
Earlier work this paper cites.
T. Richardson and R. Urbanke,
2008
Earlier work this paper cites.
S. Kudekar, T. J. Richardson, and R. L. Urbanke, “Threshold saturation via spatial coupling: why convolutional LDPC ensembles perform so well over the BEC,”
2009
Earlier work this paper cites.
M. Lentmaier, A. Sridharan, D. J. Costello, Jr., and K. S. Zigangirov, “Iterative decoding threshold analysis for LDPC convolutional codes,”
2010
Cited alongside, same era.
M. Lentmaier, D. G. M. Mitchell, G. P. Fettweis, and D. J. Costello, “Asymptotically regular LDPC codes with linear distance growth and thresholds close to capacity,” in
2010
Cited alongside, same era.
2012
Cited alongside, same era.
2012
Cited alongside, same era.
A. Yedla, Y.-Y. Jian, P. S. Nguyen, and H. D. Pfister, “A simple proof of threshold saturation for coupled scalar recursions,” in
2012
Later among the works it cites.
2013
Closest in time.
A. Iyengar, P. Siegel, R. Urbanke, and J. Wolf, “Windowed decoding of spatially coupled codes,”
2013
Closest in time.
A. Giurgiu, N. Macris, and R. L. Urbanke, “Spatial coupling as a proof technique,”
2013
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…