An inequality on guessing and its application to sequential decoding

IEEE Transactions on Information Theory

Volumn 42, Issue 1, 1996, Pages 99-105

  Arikan, Erdal ^a,b  

^a IEEE

^b BILKENT UNIVERSITY   (Turkey)

Author keywords

Guessing; Holder's inequality; R nyi's entropy; Sequential decoding

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMMUNICATION CHANNELS (INFORMATION THEORY); COMMUNICATION SYSTEMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DECODING; PROBABILITY; RANDOM PROCESSES; THEOREM PROVING;

FINITE INPUT ALPHABETS; GUESSING FUNCTION; HOLDER INEQUALITY; MEMORYLESS CHANNELS; PROBABILITY DISTRIBUTION; RANDOM VARIABLES; RENYI ENTROPY; SEQUENTIAL DECODING; SHANNON ENTROPY; TREE CODE;

INFORMATION THEORY;

EID: 0029732887     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.481781     Document Type: Article

References (22)

1. J. L. Massey, "Guessing and entropy," in Proc. 1994 IEEE Int. Symp. on Information Theory (Trondheim, Norway, 1994), p. 204.
2. E. Arikan, "On the average number of guesses required to determine the value of a random variable," in Proc. 12th Prague Conf. on Information Theory Statistical Decision Functions and Random Processes (Prague, the Czech Republic, Aug. 29-Sept. 2, 1994), pp. 20-23.
3. S. Arimoto, "Information measures and capacity of order a for discrete memoryless channels," in Topics in Information Theory (Colloquia Math. Soc. J. Bolyai),vol. 16, I. Csiszár and P. Elias, Eds. Amsterdam, The Netherlands: North Holland, 1977, pp. 41-52.
4. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
5. I. M. Jacobs and E. R. Berlekamp, "A lowerbound to the distribution of computation for sequential decoding," IEEE Trans. Inform. Theory, vol. IT-13,pp. 167-174, Apr. 1967.
6. A. Rényi, "On measures of entropy and information," in Proc. 4th Berkeley Symp. on Math. Statist. Probability (Berkeley, CA, 1961), vol. 1, pp. 547-561.
7. I. Csiszár, "Generalized cutoff rates and Rényi's information measures," IEEE Trans. Inform. Theory, vol. 41,pp. 26-34, Jan. 1995.
8. J. M. Wozencraft, "Sequential decoding for reliable communications," Tech. Rep. 325, RLE, MIT, Cambridge, MA, 1957.
9. R. M. Fano, "A heuristic discussion of sequential decoding," IEEE Trans. Inform. Theory, vol. IT-9,pp. 66-74, Jan. 1963.
10. K. Zigangirov, "Some sequential decoding procedures," Probl. Pered. Inform., vol. 2,pp. 13-25, 1966.
11. F. Jelinek, "A fast sequential decoding algorithm using a stack," IBM J. Res. Devel., vol. 13,pp. 675-685, 1969.
12. R. G. Gallager, "A simple derivation of the coding theorem and some applications," IEEE Trans. Inform. Theory, vol. IT-11,pp. 3-18, Jan. 1965.
13. D. D. Falconer, "A hybrid coding scheme for discrete memoryless channels," Bell Syst. Tech. J., vol. 48,pp. 691-728, Mar. 1969.
14. J. E. Savage, "Sequential decoding the computation problem," Bell Syst. Tech. J., vol. 45,pp. 149-175, 1966.
15. F. Jelinek, "An upper bound on moments of sequential decoding effort," IEEE Trans. Inform. Theory, vol. IT-15,pp. 140-149, Jan. 1969.
16. T. Hashimoto and S. Arimoto, "Computational moments for sequential decoding of convolutional codes," IEEE Trans. Inform. Theory, vol. IT-25,pp. 584-591, Sept. 1979.
17. E. Arikan, "Sequential decoding for multiple access channels," Ph.D. dissertation, MIT, Cambridge, MA, Nov. 1985.
18. _, "An upper bound on the cutoff rate of sequential decoding," IEEE Trans. Inform. Theory, vol. 34,pp. 55-63, Jan. 1988.
19. _, "Lower bounds to moments of list size," in of Papers, IEEE Int. Symp. on Information Theory (San Diego, CA, Jan. 14-19, 1990), pp. 145-146.
20. _, "Sequential decoding for multiple access channels," IEEE Trans. Inform. Theory, vol. 34,pp. 246-259, Mar. 1988.
21. _, "On the achievable rate region of sequential decoding for a class of multiaccess channels," IEEE Trans. Inform. Theory, vol. 36,pp. 180-183, Jan. 1990.
22. V. B. Balakirsky, "An upper bound on the distribution of computation of a sequential decoder for multiple access channels," in Proc. 6th Swedish-Russian Int. Workshop on Information Theory (Mölle, Sweden, Aug. 22-27, 1993), pp. 179-189.