New Convolutional Code Constructions and a Class of Asymptotically Good Time-Varying Codes

IEEE Transactions on Information Theory

Volumn 19, Issue 2, 1973, Pages 220-225

  Justesen, Jørn ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BCH CODES; CYCLIC CODES; TIME-VARYING CODES;

CODES, SYMBOLIC;

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

References (13)

1. J. L. Massey, D. J. Costello, and J. Justesen, “Polynomial weights and code constructions,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 101–110, Jan. 1973.
2. J. Justesen, “A class of constructive asymptotically good algebraic codes,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 652–656, Sept. 1972.
3. J. L. Massey, “Majority decoding of convolutional codes,” Res. Lab. Electron. Quart. Prog. Rep. 64, Massachusetts Inst. Technol., Cambridge, pp. 183–188, Jan. 15, 1962.
4. G. D. Forney, Jr., “Convolutional codes I: Algebraic structure,” IEEE Trans. Inform. Theory, vol. IT-16, 720–738, Nov. 1970.
5. J. L. Massey, “Some algebraic and distance properties of convolutional codes,” in H. B. Mann, Error Correcting Codes. New York: Wiley, 1968.
6. J. L. Massey and M. K. Sain, “Inverses of linear sequential circuits,” IEEE Trans. Comput., vol. C-17, pp. 330–337, Apr. 1968.
7. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
8. E. F. Assmus and H. F. Mattson, Jr., “New 5-designs,” J. Comb. Theory, vol. 6, pp. 122–151, 1969.
9. S. D. Berman, “On the theory of group codes,” Kibernetika, vol. 3, No. 1, pp. 31–39, 1967.
10. G. D. Forney, Jr., Concatenated Codes. Cambridge, Mass.: M.I.T. Press, 1966.
11. C. L. Chen, “Computer results on the minimum distance of some binary cyclic codes,” IEEE Trans. Inform. Theory (Corresp.), vol. IT-16, pp. 359–360, May 1970.
12. Neumann, B., “Distance properties of convolutional codes,” M.S. thesis, Massachusetts Inst. Technol., Cambridge, Aug. 1968.
13. V. V. Zyablov, “On estimation of complexity of construction of binary linear concatenated codes,” Probl. Peredach. Inform., vol. 7, pp. 5–13, 1971.