Abstract
Gallager codes with large block length and low rate (e.g., N ≃ 10,000–40,000, R ≃ 0.25–0.5) have been shown to have record-breaking performance for low signal-to-noise applications. In this paper we study Gallager codes at the other end of the spectrum. We first explore the theoretical properties of binary Gallager codes with very high rates and observe that Gallager codes of any rate offer runlength-limiting properties at no additional cost.
We then report the empirical performance of high rate binary and non-binary Gallager codes on three channels: the binary input Gaussian channel, the binary symmetric channel, and the 16-ary symmetric channel.
We find that Gallager codes with rate R = 8/9 and block length N = 1998 bits outperform comparable BCH and Reed-Solomon codes (decoded by a hard input decoder) by more than a decibel on the Gaussian channel.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berlekamp, E.R. (1968). Algebraic Coding Theory. New York: McGraw-Hill.
Davey, M.C. and MacKay, D.J.C. (1998a). Low density parity check codes over GF(q). In Proceedings of the 1998 IEEE Information Theory Workshop, pp. 70–71. IEEE.
Davey, M.C. and MacKay, D.J.C. (1998b). Low density parity check codes over GF(q). IEEE Communications Letters 2(6):165–167.
Gallager, R.G. (1962). Low density parity check codes. IRE Trans. Info. Theory IT-8:21–28.
Gallager, R.G. (1963). Low Density Parity Check Codes. Number 21 in Research monograph series. Cambridge, Mass.: MIT Press.
Karplus, K. and Krit, H. (1991). A semi-systolic decoder for the PDSC-73 error-correcting code. Discrete Applied Mathematics 33:109–128.
Lucas, R., Fossorier, M., Kou, Y., and Lin, S., (1999). Iterative decoding of one-step majority logic decodable codes based on belief propagation. Submitted.
MacKay, D.J.C. (1999a). Almost-certainly runlength-limiting codes. vol.ra.phy.cam.ac.uk/mackay.
MacKay, D.J.C. (1999b). Encyclopedia of sparse graph codes (hypertext archive). http://vol.ra.phy.cam.ac.uk/mackay/codes/data.html.
MacKay, D.J.C. (1999c). Good error correcting codes based on very sparse matrices. IEEE Transactions on Information Theory 45(2):399–431.
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.
Richardson, T. and Urbanke, R. (1998). The capacity of low-density parity check codes under message-passing decoding. Submitted to IEEE Trans. on Information Theory.
Tanner, R.M. (1981). A recursive approach to low complexity codes. IEEE Transactions on Information Theory 27(5):533–547.
Urbanke, R., Richardson, T., and Shokrollahi, A. (1999). Design of provably good low density parity check codes. Submitted.
Worthen, A. and Stark, W. (1998). Low-density parity check codes for fading channels with memory. In Proceedings of the 36th Allerton Conference on Communication, Control, and Computing, Sept. 1998, pp. 117–125.
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). Evaluation of Gallager Codes for Short Block Length and High Rate Applications. 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_6
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0165-3_6
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