On Decoding Iterated Codes

IEEE Transactions on Information Theory

Volumn 16, Issue 5, 1970, Pages 624-627

  Reddy, Sudhakar M ^a  

^a UNIVERSITY OF IOWA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECORDERS; IETTA; INFORMATION THEORY; MAX;

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

References (7)

1. N. Abramson, “Cascade decoding of cyclic product codes,” IEEE Trans. Communication Technology, vol. COM-16, pp. 398–402, June 1968.
2. H. O. Burton and E. J. Weldon, “Cyclic product codes,” IEEE Trans. Information Theory, vol. PGIT-11, pp. 433–439, July 1965.
3. P. Elias, “Error free coding,” IRE Trans. Information Theory, vol. PGIT-4, pp. 29–37, September 1954.
4. W. C. Gore, “The equivalence of L-step orthogonalization and a Reed-decoding procedure,” IEEE Trans. Information Theory (Correspondence), vol. IT-15, p. 184, January 1969.
5. J. L. Massey, Threshold Decoding. Cambridge, Mass.: M.I.T. Press, 1963.
6. S. M. Reddy and J. P. Robinson, “A decoding algorithm for some convolutional codes constructed from block codes,” Inform. and Control, vol. 12, pp. 492–507, November 1968.
7. L. J. Weng, “On linear product codes and their duals,” Northeastern University, Boston, Mass., Sci. Rept. 4, June 1966.