Fetching the paper…
Reading the bibliography…
We investigate spatially coupled code ensembles.
C. E. Shannon, “A mathematical theory of communication,” Bell System Tech. J. , vol. 27, pp. 379–423, 623–656, July/Oct. 1948
1948
Earlier work this paper cites.
M. J. E. Golay, “Notes on digital coding,” Proc. IRE , vol. 37, p. 657, June 1949
1949
Earlier work this paper cites.
R. W. Hamming, “Error detecting and error correcting codes,” Bell System Tech. J. , vol. 26, no. 2, pp. 147–160, 1950
1950
Earlier work this paper cites.
P. Elias, “Coding for noisy channels,” in IRE International Convention Record , Mar. 1955, pp. 37–46
1955
Earlier work this paper cites.
J. M. Wozencraft, “Sequential decoding for reliable communication,” MIT, Cambridge, MA, USA, Research Lab. of Electron. Tech. Rept. 325, 1957
1957
Earlier work this paper cites.
A. Hocquenghem, “Codes correcteurs d’erreurs,” Chiffres , vol. 2, pp. 147–156, 1959
1959
Earlier work this paper cites.
R. C. Bose and D. K. Ray-Chaudhuri, “On a class of error-correcting binary group codes,” Inform. Contr. , vol. 3, pp. 68–79, Mar. 1960
1960
Earlier work this paper cites.
I. S. Reed and G. Solomon, “Polynomial codes over certain finite fields,” SIAM J. , vol. 8, no. 2, pp. 300–304, June 1960
1960
Earlier work this paper cites.
R. G. Gallager, Low-Density Parity-Check Codes . Cambridge, MA, USA: MIT Press, 1963
1963
Earlier work this paper cites.
A. J. Viterbi, “Error bounds of convolutional codes and an asymptotically optimum decoding algorithm,” IEEE Trans. Inform. Theory , vol. 13, no. 2, pp. 260–269, Apr. 1967
1967
Earlier work this paper cites.
G. D. Forney, Jr., “Review of random tree codes,” Dec. 1967, appendix A, Final Report, Contract NAS2-3637, NASA CR73176, NASA Ames Res. Ctr
1967
Earlier work this paper cites.
J. A. Heller, “Short constraint length convolutional codes,” 1968, Jet Prop. Lab., Space Prog. Summary 37-54
1968
Earlier work this paper cites.
J. Massey, “Shift-register synthesis and BCH decoding,” Information Theory, IEEE Transactions on , vol. 15, no. 1, pp. 122 – 127, Jan. 1969
1969
Earlier work this paper cites.
J. K. Omura, “On the Viterbi decoding algorithm,” IEEE Trans. Inform. Theory , vol. 15, pp. 177–179, 1969
1969
Earlier work this paper cites.
——, “Improved performance of short constraint length convolutional codes,” 1969, Jet Prop. Lab., Space Prog. Summary 37-56
1969
Earlier work this paper cites.
S. S. Vallender, “Calculation of the Wasserstein distance between probability distributions on the line,” Theor. Probability Appl. , vol. 18, pp. 784–786, 1973
1973
Earlier work this paper cites.
R. de Buda, “The upper error bound of a new near-optimal code,” IEEE Trans. Inform. Theory , vol. 21, pp. 441–445, July 1975
1975
Earlier work this paper cites.
G. Ungerboeck, “Channel Coding with Multilevel/Phase Signals,” IEEE Trans. Inform. Theory , vol. 28, pp. 55–67, Jan. 1982
1982
Earlier work this paper cites.
E. R. Berlekamp, Algebraic Coding Theory . Walnut Creek, CA, USA: Aegean Park Press, 1984, revised
1984
Earlier work this paper cites.
——, “Trellis-coded modulation with redundant signal sets part I: Introduction,” IEEE Commun. Mag. , vol. 25, no. 2, pp. 5–11, Feb. 1987
1987
Earlier work this paper cites.
——, “Trellis-coded modulation with redundant signal sets part II: State of the art,” IEEE Commun. Mag. , vol. 25, no. 2, pp. 12–21, Feb. 1987
1987
Earlier work this paper cites.
G. D. Forney, Jr., “Coset codes-Part I: Introduction and geometrical classification,” IEEE Trans. Inform. Theory , pp. 1123–1151, Sept. 1988
1988
Earlier work this paper cites.
——, “Coset codes-Part I: Introduction and geometrical classification,” IEEE Trans. Inform. Theory , pp. 1152–1187, Sept. 1988
1988
Earlier work this paper cites.
——, “Some optimal codes have structure,” IEEE J. Sel. Area. Commun. , vol. 7, pp. 893–899, Aug. 1989
1989
Earlier work this paper cites.
C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding,” in Proc. of ICC , Geneva, Switzerland, May 1993, pp. 1064–1070
1993
Earlier work this paper cites.
D. J. C. MacKay and R. M. Neal, “Good codes based on very sparse matrices,” in Cryptography and Coding. 5th IMA, USA Conf., LNCS 1025 , C. Boyd, Ed. Berlin: Springer, 1995, pp. 100–111
1995
Earlier work this paper cites.
D. A. Spielman, “Computationally efficient error-correcting codes and holographic proofs,” Ph.D. dissertation, MIT, June 1995
1995
Earlier work this paper cites.
D. A. Spielman, “Linear-time encodeable and decodable error-correcting codes,” IEEE Trans. Inform. Theory , vol. 42, no. 6, pp. 1723–1731, Nov. 1996
1996
Earlier work this paper cites.
M. Sipser and D. A. Spielman, “Expander codes,” IEEE Trans. Inform. Theory , vol. 42, no. 6, pp. 1710–1722, Nov. 1996
1996
Earlier work this paper cites.
D. J. C. MacKay and R. M. Neal, “Near Shannon limit performance of low density parity check codes,” Electron. Lett. , vol. 32, no. 18, pp. 1645–1646, Aug. 1996
1996
Earlier work this paper cites.
——, “Near Shannon limit performance of low density parity check codes,” Electron. Lett. , vol. 33, no. 6, pp. 457–458, Mar. 1997, reprinted because of printing errors in 1996
1996
Earlier work this paper cites.
N. Wiberg, “Codes and decoding on general graphs,” Ph.D. dissertation, Linköping University, S-581 83, Linköping, Sweden, 1996
1996
Earlier work this paper cites.
M. Sudan, “Decoding Reed-Solomon codes beyond the error-correction diameter,” in Proc. of the Allerton Conf. on Commun., Control, and Computing , Monticello, IL, USA, 1997
1997
Earlier work this paper cites.
H. A. Loeliger, “Averaging bounds for lattice and linear codes,” IEEE Trans. Inform. Theory , vol. 43, pp. 1767–1773, Nov. 1997
1997
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.
V. M. Zolotarev, Modern Theory of Summation of Random Variables, . VSP, Utrecht, 1997
1997
Earlier work this paper cites.
R. Urbanke and B. Rimoldi, “Lattice codes can achieve capacity on the AWGN channel,” IEEE Trans. Inform. Theory , vol. 44, no. 1, pp. 273–278, Jan. 1998
1998
Earlier work this paper cites.
——, “Analysis of low density codes and improved designs using irregular graphs,” in Proc. of the 30th Annual ACM Symposium on Theory of Computing , 1998, pp. 249–258
1998
Earlier work this paper cites.
D. Divsalar, H. Jin, and R. J. McEliece, “Coding theorems for ”turbo-like” codes,” in Proc. of the Allerton Conf. on Commun., Control, and Computing , Monticello, IL, USA, Sept. 1998, pp. 201–210
1998
Cited alongside, same era.
V. Guruswami and M. Sudan, “Improved decoding of Reed-Solomon and algebraic-geometry codes,” IEEE Trans. Inform. Theory , vol. 45, no. 6, pp. 1757–1767, Sept. 1999
1999
Cited alongside, same era.
D. J. C. MacKay, “Good error correcting codes based on very sparse matrices,” IEEE Trans. Info. Theory , vol. 45, no. 2, pp. 399–431, 1999. [Online]. Available: http://www.inference.phy.cam.ac.uk/mackay/abstracts/mncN.html
1999
Cited alongside, same era.
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
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.
C. Villani, Optimal transport, Old and New . Springer, 2009, vol. 338
2009
Later among the works it cites.
S. Hassani, K. Alishahi, and R. Urbanke, “On the scaling of polar codes II: The behavior of un-polarized channels,” in Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on , June 2010, pp. 879 –883
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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
Cited alongside, same era.
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
Cited alongside, same era.
S. ten Brink, “Designing iterative decoding schemes with the extrinsic information transfer chart,” AEU Int. J. Electron. Commun. , vol. 54, pp. 389–398, Dec. 2000
2000
Cited alongside, same era.
F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, “Factor graphs and the sum-product algorithm,” IEEE Trans. Inform. Theory , vol. 47, no. 2, pp. 498–519, Feb. 2001
2001
Cited alongside, same era.
M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. A. Spielman, “Improved low-density parity-check codes using irregular graphs,” IEEE Trans. Inform. Theory , vol. 47, no. 2, pp. 585–598, Feb. 2001
2001
Cited alongside, same era.
S.-Y. Chung, T. Richardson, and R. Urbanke, “Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation,” IEEE Trans. Inform. Theory , vol. 47, no. 2, pp. 657–670, Feb. 2001
2001
Cited alongside, same era.
M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. A. Spielman, “Efficient erasure correcting codes,” IEEE Trans. Inform. Theory , vol. 47, no. 2, pp. 569–584, Feb. 2001
2001
Cited alongside, same era.
T. Richardson and R. Urbanke, “The capacity of low-density parity check codes under message-passing decoding,” IEEE Trans. Inform. Theory , vol. 47, no. 2, pp. 599–618, Feb. 2001
2001
Cited alongside, same era.
2010
Later among the works it cites.
S. Korada, A. Montanari, E. Telatar, and R. Urbanke, “An empirical scaling law for polar codes,” in Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on , June 2010, pp. 884 –888
2010
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
Later among the works it cites.
M. Lentmaier and G. P. Fettweis, “On the thresholds of generalized LDPC convolutional codes based on protographs,” in Proc. of the IEEE Int. Symposium on Inform. Theory , Austin, TX, USA, June 2010, pp. 709–713
2010
Later among the works it cites.
M. Papaleo, A. Iyengar, P. Siegel, J. Wolf, and G. Corazza, “Windowed erasure decoding of LDPC convolutional codes,” in Proc. of the IEEE Inform. Theory Workshop , Cairo, Egypt, Jan. 2010, pp. 78 – 82
2010
Later among the works it cites.
S. Kudekar, C. Measson, T. Richardson, and R. Urbanke, “Threshold Saturation on BMS Channels via Spatial Coupling,” in Proc. of the Int. Conference on Turbo Codes and Related Topics , Sept. 2010
2010
Later among the works it cites.
M. Lentmaier, D. G. M. Mitchell, G. P. Fettweis, and D. J. Costello, Jr., “Asymptotically good LDPC convolutional codes with AWGN channel thresholds close to the Shannon limit,” Sept. 2010, 6th International Symposium on Turbo Codes and Iterative Information Processing
2010
Later among the works it cites.
2010
Later among the works it cites.
S. Kudekar and H. D. Pfister, “The Effect of Spatial Coupling on Compressive Sensing,” in Proc. of the Allerton Conf. on Commun., Control, and Computing , Monticello, IL, USA, 2010
2010
Later among the works it cites.
S. H. Hassani, N. Macris, and R. Urbanke, “Coupled graphical models and their thresholds,” in Proc. of the IEEE Inform. Theory Workshop , Dublin, Ireland, Sept. 2010
2010
Later among the works it cites.
S. Kudekar, T. Richardson, and R. Urbanke, “Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform so well over the BEC,” IEEE Trans. Inform. Theory , vol. 57, no. 2, pp. 803–834, Feb. 2011
2011
Later among the works it cites.
A. Pusane, R. Smarandache, P. Vontobel, and J. D.J. Costello, “Deriving good LDPC convolutional codes from LDPC block codes,” IEEE Trans. Inform. Theory , vol. 55, no. 6, pp. 2577–2598, Feb. 2011
2011
Later among the works it cites.
A. Iyengar, M. Papaleo, P. Siegel, J. Wolf, A. Vanelli-Coralli, and G. Corazza, “Windowed decoding of protograph-based LDPC convolutional codes over erasure channels,” Information Theory, IEEE Transactions on , vol. PP, no. 99, p. 1, 2011
2011
Later among the works it cites.
A. Iyengar, P. Siegel, R. Urbanke, and J. Wolf, “Windowed decoding of spatially coupled codes,” in Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on , 31 2011-aug. 5 2011, pp. 2552 –2556
2011
Later among the works it cites.
P. Olmos and R. Urbanke, “Scaling behavior of convolutional LDPC ensembles over the BEC,” in Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on , 31 2011-aug. 5 2011, pp. 1816 –1820
2011
Later among the works it cites.
K. Kasai and K. Sakaniwa, “Spatially-coupled MacKay-Neal codes and Hsu-Anastasopoulos codes,” in Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on , 31 2011-aug. 5 2011, pp. 747 –751
2011
Later among the works it cites.
V. Aref and R. Urbanke, “Universal rateless codes from coupled lt codes,” Aug. 2011, to be presented, IEEE ISIT’2011
2011
Later among the works it cites.
S. Kudekar and K. Kasai, “Threshold saturation on channels with memory via spatial coupling,” in Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on , 31 2011-aug. 5 2011, pp. 2562 –2566
2011
Later among the works it cites.
——, “Spatially coupled codes over the multiple access channel,” in Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on , 31 2011-aug. 5 2011, pp. 2816 –2820
2011
Later among the works it cites.
2011
Later among the works it cites.
H. Uchikawa, K. Kasai, and K. Sakaniwa, “Spatially coupled LDPC codes for decode-and-forward in erasure relay channel,” in Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on , 31 2011-aug. 5 2011, pp. 1474 –1478
2011
Later among the works it cites.
A. Yedla, H. Pfister, and K. Narayanan, “Universality for the noisy slepian-wolf problem via spatial coupling,” in Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on , 31 2011-aug. 5 2011, pp. 2567 –2571
2011
Later among the works it cites.
H. Uchikawa, B. Kurkoski, K. Kasai, and K. Sakaniwa, “Threshold Improvement of Low-Density Lattice Codes via Spatial Coupling,” 2011
2011
Later among the works it cites.
A. Yedla, P. Nguyen, H. Pfister, and K. Narayanan, “Universal codes for the Gaussian MAC via spatial coupling,” 2011
2011
Later among the works it cites.
——, “Spatially-coupled codes and threshold saturation on intersymbol-interference channels,” 2011
2011
Later among the works it cites.
Y. Sato, K. Kasai, and K. Sakaniwa, “Compressed sensing via node-based verification recovery with band sparse matrices,” 2011
2011
Later among the works it cites.
2011
Later among the works it cites.
2011
Later among the works it cites.
2011
Later among the works it cites.
2011
Later among the works it cites.
2011
Later among the works it cites.
L. Boczkowski, “New extremes of information combining inequalities,” 2011, in preparation
2011
Later among the works it cites.
S. Kudekar, T. Richardson, and R. Urbanke, “Wave-Like Solutions of General One-Dimensional Spatially Coupled Systems,” Jan. 2012, in preparation
2012
Closest in time.