The Complexity of Decoders—Part II: Computational Work and Decoding Time

IEEE Transactions on Information Theory

Volumn 17, Issue 1, 1971, Pages 77-85

  Savage, John E ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODING; COMMUNICATION CHANNELS; DECODERS; IETTA; INFORMATION THEORY; NOISE;

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

References (20)

1. E. Savage, “The complexity of decoders-Pt. I: Decoder classes,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 689–695, November 1969.
2. J. Ziv, “Asymptotic performance and complexity of a coding scheme for memoryless channels,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 356–359, July 1967.
3. “Further results on the asymptotic complexity of an iterative coding scheme,” IEEE Trans. Inform. Theory, vol. 1T-12, pp. 168–171, April 1966.
4. G. D. Forney, Concatenated Codes. Cambridge, Mass.: M.I.T. Press, 1966, ch. 4.
5. S. Winograd, “On the time required to perform addition,” J. ACM, vol. 12, no. 2, pp. 277–285, 1965.
6. J. E. Savage, “Some comments on the computation time and complexity of algorithms,” Proc. Princeton Conf. Inform. Sciences and Systems, 1969.
7. D. E. Muller, “Complexity in electronic switching circuits,” IRE Trans. Electron. Comput., vol. EC-5, pp. 15–19, March 1956.
8. C. E. Shannon, R. G. Gallager, and E. R. Berlekamp, “Lower bounds to error probability for coding on discrete memoryless channels,” Inform. and Control, vol. 10, pp. 65–103, 522–552, 1967.
9. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968, ch. 5.
10. F. Jelinek, Probabilistic Information Theory. New York: McGraw-Hill, 1968.
11. R. G. Gallager, op. cit., p. 164.
12. I. S. Reed, and G. Solomon, “Polynomial codes over certain finite fields,” J. SIAM, vol. 8, pp. 300–304, 1960.
13. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968, ch. 7.
14. J. E. Savage, HA note on the performance of concatenated coding,” IEEE Trans. Inform. Theory (Correspondence), vol. IT-16, pp. 512–513, July 1970.
15. “Progress in sequential decoding,” in Advances in Communication Systems, vol. 3, A. V. Balakrishnan, Ed. New York: Academic Press, 1968.
16. J. M. Wozencraft and I. M. Jacobs, Principles of Communication Engineering. New York: Wiley, 1965, ch. 6.
17. 1. E. Savage, “Sequential decoding-The computation problem,” Bell Syst. Tech. J., vol. 45, no. 1, pp. 149–175, 1966.
18. I. M. Jacobs and E. R. Berlekamp,”A lower bound to the distribution of computation for sequential decoding,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 167–174, April 1967.
19. S. Winograd, “On the time required to perform multiplication,” J. ACM, vol. 14, no. 4, pp. 793-802,1967.
20. W. W. Peterson, Error-Correcting Codes. Cambridge, Mass.: M.I.T. Press, and New York: Wiley, 1961.