The Existence of Binary Linear Concatenated Codes with Reed-Solomon Outer Codes Which Asymptotically Meet the Gilbert-Varshamov Bound

IEEE Transactions on Information Theory

Volumn 29, Issue 6, 1983, Pages 850-853

  Thommesen, Christian ^a  

^a AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

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

References (6)

1. G. D. Fomey, 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-13, 1971.
3. J. Justesen, “A class of constructive asymptotically good algebraic codes,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 652-656, 1972.
4. E. L. Blokh and V. V. Zyablov, “Existence of linear concatenated binary codes with optimal correcting properties,” Probl. Peredach. Inform., vol. 9, pp. 3-10, 1973.
5. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes. New York: North-Holland, 1978.
6. G. D. Forney, Jr., “Convolutional codes II: Maximum likelihood decoding,” Inform. Contr., vol. 25, pp. 222-266, 1974.