An Algebraic Construction of Rate 1/v Convolutional Codes

IEEE Transactions on Information Theory

Volumn 21, Issue 5, 1975, Pages 577-580

  Justesen, Jørn ^a  

^a AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CONVOLUTIONAL CODES;

CODES, SYMBOLIC;

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

References (8)

1. I. S. Reed and G. Solomon “Polynomial codes over certain finite fields,” J. Soc. Ind. Appl. Math., vol. 8, pp. 300–304, 1960.
2. G. D. Forney, Jr., Concatenated Codes. Cambridge, Mass.: M.I.T. Press, 1966.
3. J. Justesen “A class of constructive, asymptotically good algebraic codes,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 652–656, Sept. 1972.
4. J. L. Massey, D. L. Costello, and J. Justesen “Polynomial weights and code constructions,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 101–110, Jan. 1973.
5. J. Justesen “New convolutional code constructions and a class of asymptotically good time-varying codes,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 220–225, Mar. 1973.
6. G. D. Forney, Jr. “Convolutional codes I: Algebraic structure,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 720–738, Nov. 1970.
7. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
8. J. Justesen and L. R. Hughes, “On maximum-distance-separable convolutional codes,” IEEE Trans. Inform. Theory (Corresp.), vol. IT-20, p. 288, Mar. 1974.