Abstract
In this paper we will survey some of the most recent results on low-density parity-check codes. Our emphasis will be primarily on the asymptotic theory of these codes. For the most part, we will introduce the main concepts for the easier case of the erasure channel. We will also give an application of these methods to reliable content delivery.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
L. Bazzi, T. Richardson, and R. Urbanke. Exact thresholds and optimal codes for the binary symmetric channel and Gallager’s decoding algorithm A. IEEE Trans. Inform. Theory, 2001. Submitted.
E.R. Berlekamp, R.J. McEliece, and H.C.A. van Tilborg. On the inherent intractability of certain coding problems. IEEE Trans. Inform. Theory, 24:384–386, 1978.
C. Berrou, A. Glavieux, and P. Thitimajshima. Near Shannon limit errorcorrecting coding and decoding. In Proceedings of ICC’93, pages 1064–1070, Geneva, Switzerland, May 1993.
S-Y. Chung, D. Forney, T. Richardson, and R. Urbanke. On the design of lowdensity parity-check codes within 0.0045 dB of the Shannon limit. IEEE Commu. Letters, 2001. To appear.
P. Elias. Coding for two noisy channels. In Information Theory, Third London Symposium, pages 61–76, 1955.
R. G. Gallager. Low Density Parity-Check Codes. MIT Press, Cambridge, MA, 1963.
J.H. van Lint. Introduction to Coding Theory, volume 86 of Graduate Texts in Mathematics. Springer Verlag, third edition, 1998.
M. Luby, M. Mitzenmacher, and A. Shokrollahi. Analysis of random processes via and-or tree evaluation. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 364–373, 1998.
M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman. Analysis of low density codes and improved designs using irregular graphs. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 249–258, 1998.
M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman, and V. Stemann. Practical loss-resilient codes. In Proceedings of the 29th annual ACM Symposium on Theory of Computing, pages 150–159, 1997.
D.J.C. MacKay. Good error-correcting codes based on very sparse matrices. IEEE Trans. Inform. Theory, 45:399–431, 1999.
G. A. Margulis. Explicit constructions of graphs without short cycles and low density codes. Combinatorica, 2:71–78, 1982.
P. Oswald and A. Shokrollahi. Capacity-achieving sequences for the erasure channel. 2000. Manuscript.
T. Richardson, A. Shokrollahi, and R. Urbanke. Design of provably good lowdensity parity check codes. IEEE Trans. Inform. Theory (submitted), 1999.
T. Richardson and R. Urbanke. The capacity of low-density parity check codes under message-passing decoding. IEEE Trans. Inform. Theory (submitted), 1998.
T. Richardson and R. Urbanke. Efficient encoding of low-density parity-check codes. IEEE Trans. Inform. Theory, 2001. Submitted.
A. Shokrollahi. Newsequences of linear time erasure codes approaching the channel capacity. In M. Fossorier, H. Imai, S. Lin, and A. Poli, editors, Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, number 1719 in Lecture Notes in Computer Science, pages 65–76, 1999.
A. Shokrollahi. Capacity-achieving sequences, volume 123 of IMA Volumes in Mathematics and its Applications, pages 153–166. 2000.
M. Sipser and D. Spielman. Expander codes. IEEE Trans. Inform. Theory, 42:1710–1722, 1996.
D. Spielman. Linear-time encodable and decodable error-correcting codes. IEEE Trans. Inform. Theory, 42:1723–1731, 1996.
M. R. Tanner. A recursive approach to lowcomplexit y codes. IEEE Trans. Inform. Theory, 27:533–547, 1981.
V. V. Zyablov. An estimate of the complexity of constructing binary linear cascade codes. Probl. Inform. Transm., 7:3–10, 1971.
V. V. Zyablov and M. S. Pinsker. Estimation of error-correction complexity of Gallager low-density codes. Probl. Inform. Transm., 11:18–28, 1976.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Shokrollahi, A. (2002). An Introduction to Low-Density Parity-Check Codes. In: Khosrovshahi, G.B., Shokoufandeh, A., Shokrollahi, A. (eds) Theoretical Aspects of Computer Science. TACSci 2000. Lecture Notes in Computer Science, vol 2292. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45878-6_6
Download citation
DOI: https://doi.org/10.1007/3-540-45878-6_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43328-6
Online ISBN: 978-3-540-45878-4
eBook Packages: Springer Book Archive