Convolutional Codes I: Algebraic Structure

IEEE Transactions on Information Theory

Volumn 16, Issue 6, 1970, Pages 720-738

  Forney, G David ^a  

^a MOTOROLA INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVOLUTIONAL CODES; ENCODERS;

INFORMATION THEORY;

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

References (17)

1. J. K. Omura, “On the Viterbi decoding algorithm,” IEEE Trans. Information Theory, vol. IT-15, pp. 177–179, January 1969.
2. A. J. Viterbi, “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm,” IEEE Trans. Information Theory, vol. IT-13, pp. 260–269, April 1967.
3. J. L. Massey and M. K. Sain, “Codes, automata, and continuous systems: Explicit interconnections,” IEEE Trans. Automatic Control, vol. AC-12, pp. 644–650, December 1967.
4. J. L. Massey and M. K. Sain, “Inverses of linear sequential circuits,” IEEE Trans. Computers, vol. C-17, pp. 330–337, April 1968.
5. M. K. Sain and J. L. Massey, “Invertibility of linear time-invariant dynamical systems,” IEEE Trans. Automatic Control, vol. AC-14, pp. 141–149, April 1969.
6. D. D. Sullivan, “Control of error propagation in convolutional codes,” University of Notre Dame, Notre Dame, Ind., Tech. Rept, EE-667, November 1966.
7. R. R. Olson, “Note on feedforward inverses for linear sequential circuits,” Dept. of Elec. Engrg., University of Notre Dame, Notre Dame, Ind., Tech. Rept. EE-684, April 1, 1968; also IEEE Trans. Computers (to be published).
8. D. J. Costello, “Construction of convolutional codes for sequential decoding,” Dept. of Elec. Engrg., University of Notre Dame, Notre Dame, Ind., Tech. Rept. EE-692, August 1969.
9. W. W. Peterson, Error-Correcting Codes. Cambridge, Mass.: M.I.T. Press, 1961.
10. C. W. Curtis and I. Reiner, Representation Theory of Finite Groups and Associative Algebras. New York: Interscience, 1962, pp. 94–96.
11. R. E. Kalman, P. L. Falb, and M. A. Arbib, Topics in Mathematical System Theory. New York: McGraw-Hill, 1969, ch. 10.
12. R. E. Kalman, “Irreducible representations and the degree of a rational matrix,” J. SIAM Control, vol. 13, pp. 520–544, 1965.
13. B. McMillan, “Introduction to formal realizability theory,” Bell Sys. Tech. J., vol. 31 pp. 217–279, 541–600, 1952.
14. J. L. Massey, Threshold Decoding. Cambridge, Mass.: M.LT. Prees, 1963, pp. 23–24.
15. J. J. Hussgang, “Some properties of binary convolutional code generators, IEEE Trans. Information Theory, vol. IT-11, pp. 90–100 January 1965
16. E. A. Bucher and J. A. Heller, “Error probability bounds for systematic convolutional codes,” IEEE Trans. Information Theory, vol. IT-16, pp. 219–224, March 1970.
17. E. A. Bucher, “Error mechanisms for convolutional codes,” Ph.D. dissertation, Dept. of Elec, Engrg., Massachusetts Institute of Technology, Cambridge, September 1968.