Abstract
We present a pair of Gallager codes with rate R = 1/3 and transmitted blocklength N = 1920 as candidates for the proposed international standard for cellular telephones.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Davey, M.C. and MacKay, D.J.C. (1998). Low density parity check codes over GF(q). In Proceedings of the 1998 IEEE Information Theory Workshop, pp. 70–71. IEEE.
Gallager, R.G. (1962). Low density parity check codes. IRE Trans. Info. Theory, IT-8: 21–28.
JPL (1999). Code imperfectness. http://www331.jpl.nasa.gov/public/imperfectness.html.
MacKay, D.J.C. (1999a). Encyclopedia of sparse graph codes (hypertext archive). http://vo1.ra.phy.cam.ac.uk/mackay/codes/data.html.
MacKay, D.J.C. (1999b). Gallager codes — recent results. In Proceedings of International Symposium on Communication Theory and Applications, Ambleside, 1999, ed. by M.D.B. Honary and P. Farrell. Research Studies Press.
MacKay, D.J.C. and Neal, R.M. (1996). Near Shannon limit performance of low density parity check codes. Electronics Letters, 32(18):1645–1646. Reprinted Electronics Letters, 33(6):457-458, March 1997.
MacKay, D.J.C., Wilson, S.T., and DAVEY, M.C. (1999). Comparison of constructions of irregular Gallager codes. IEEE Transactions on Communications, 47(10):1449–1454.
Urbanke, R., Richardson, T., and Shokrollahi, A. (1999). Design of provably good low density parity check codes. Submitted.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag New York, Inc.
About this paper
Cite this paper
MacKay, D.J.C., Davey, M.C. (2001). Two Small Gallager Codes. In: Marcus, B., Rosenthal, J. (eds) Codes, Systems, and Graphical Models. The IMA Volumes in Mathematics and its Applications, vol 123. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-0165-3_7
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0165-3_7
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-95173-7
Online ISBN: 978-1-4613-0165-3
eBook Packages: Springer Book Archive