Error-Correcting Capabilities of Concatenated Codes with MDS Outer Codes on Memoryless Channels with Maximum-Likelihood Decoding

IEEE Transactions on Information Theory

Volumn 33, Issue 5, 1987, Pages 632-640

  Thommesen, Christian ^a  

^a AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL COMMUNICATION SYSTEMS; INFORMATION THEORY - COMMUNICATION CHANNELS; PROBABILITY;

CONCATENATED CODING; DISCRETE MEMORYLESS CHANNEL; GALLAGER RANDOM CODING THEOREM; LINEAR CONCATENATED CODES; MAXIMUM-LIKELIHOOD DECODING;

CODES, SYMBOLIC;

EID: 0023416371     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1987.1057352     Document Type: Article

References (19)

1. G.D. Forney, Jr., Concatenated Codes. Cambridge, MA: MIT, 1966.
2. V.V. Zyablov, “On estimation of complexity of construction of binary linear concatenated codes,” Probl. Peredach. Inform., vol. 7, pp. 5–12, 1971.
3. J. Justesen, “A class of constructive asymptotically good algebraic codes,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 652–656, 1972.
4. P. Delsarte and P. Piret, “Algebraic constructions of Shannon codes for regular channels,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 593–599, 1982.
5. E.L. Blokh and V.V. Zyablov, “Existence of linear concatenated binary codes with optima] correcting properties,” Probl. Peredach. Inform., vol. 9, pp. 3–10, 1973.
6. E.L. Blokh, Linejnye Kaskadnye Kody (Linear Concatenated Codes, in Russian). Moscow: Nauka, 1982.
7. C. Thommesen, “The existence of binary linear concatenated codes with Reed-Solomon outer codes which asymptotically meet the Gilbert-Varshamov bound,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 850–853, 1983.
8. R.G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT, 1963.
9. F.J. MacWilliams and N.J.A. Sloane, The Theory of Error Correcting Codes. New York: North-Holland, 1978.
10. R.G. Gallager, “A simple derivation of the coding theorem and some applications,” IEEE Trans. Inform. Theory, vol. IT-11, pp. 3–18, 1965.
11. A.J. Viterbi, “Convolutional codes and their performance in communication systems,” IEEE Trans. Commun. Technol., vol. COM-19, pp. 751–772.
12. G.D. Forney, Jr., “Convolution codes II: Maximum-likelihood decoding,” Inform. Control, vol. 25, pp. 222–266, 1974.
13. R.G. Gallager, Information Theory and Reliable Communication. New York: Wiley & Sons, 1968.
14. A.J. Viterbi and J.K. Omura, Principles of Digital Communication and Coding. New York: McGraw-Hill, 1979.
15. R.J. McEliece, The Theory of Information and Coding. Reading, MA: Addison-Wesley, 1977.
16. C.E. Shannon, “The zero error capacity of a noisy channel,” IRE Trans. Inform. Theory, vol. IT-2, pp. 8–19, 1956.
17. J.H. van Lint, Introduction to Coding Theory. New York: SpringerVerlag, 1982.
18. C.E. Shannon, R.G. Gallager, and E.R. Berlekamp, “Lower bounds to error probability for coding on discrete memoryless channels, Part I,” Inform. Control, vol. 10, pp. 65–103, 1967.
19. C.E. Shannon, “Lower bounds to error probability for coding on discrete memoryless channels, Part II,” Inform. Control, vol. 10, pp. 522–552, 1967.