Bounds on a probability for the heavy tailed distribution and the probability of deficient decoding in sequential decoding

IEEE Transactions on Information Theory

Volumn 51, Issue 3, 2005, Pages 990-1002

  Hashimoto, Takeshi ^a  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

Buffer overflow; Convolutional code; Fano algorithm; Heavy tailed distribution; Pareto distribution; Probability of deficient decoding; Sequential decoding

Indexed keywords

ALGORITHMS; CONVOLUTIONAL CODES; ENCODING (SYMBOLS); ERROR ANALYSIS; PROBABILITY DISTRIBUTIONS; RELIABILITY; THEOREM PROVING; VECTORS;

BUFFER OVERFLOW; DEFICIENT DECODING; FANO ALGORITHM; HEAVY TAILED DISTRIBUTION; SEQUENTIAL DECODING;

DECODING;

EID: 15044360931     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.842580     Document Type: Article

References (33)

1. E. Arikan, "An upper bound on the cutoff rate of sequential decoding," IEEE Trans. Inf. Theory, vol. 34, no. 1, pp. 55-63, Jan. 1988.
2. E. Arikan, "An inequality on guessing and its application to sequential decoding," IEEE Trans. Inf. Theory, vol. 42, no. 1, pp. 99-105, Jan. 1996.
3. S. Arimoto and T. Hashimoto, "The complexity of decoding for tree codes and convolutional codes," in Abstracts of Papers in 1979 IEEE Int. Symp. Information Theory, Grignano, Italy, Jun. 25-29, 1979, p. 79.
4. B. von Bahr and C. Esseen, "Inequalities for the rth absolute moment of a sum of random variables 1 ≤ r ≤ 2," Ann. Math. Statist., vol. 36, pp. 299-303, 1965.
5. M. Blaum, P. G. Farrell, and H. C. A. van Tilborg, Eds., Information, Coding, and Mathematics. Boston, MA: Kluwer, 2002.
6. R. Blahut and R. Koetter, Eds., Codes, Graphs, and Systems. Boston, MA: Kluwer, 2002.
7. S. Boztas, "An inequality on guessing and its application to sequential decoding," IEEE Trans. Inf. Theory, vol. 43, no. 6, pp. 2062-2063, Nov. 1997.
8. J. A. Bucklew, Large Deviation Techniques in Decision, Simulation, and Estimation. New York: Wiley, 1990.
9. P. E. Chevillat and D. J. Costello Jr, "Distance and computation in sequential decoding," IEEE Trans. Commun., vol. COM-24, no. 4, pp. 440-447, Apr. 1976.
10. P. E. Chevillat, D.J. Costello Jr, "An analysis of sequential decoding for specific time-invariant convolutional codes," IEEE Trans. Inf. Theory, vol. IT-24, no. 4, pp. 443-451, Jul. 1978.
11. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
12. R. M. Fano, "A heuristic discussion of probabilistic decoding," IEEE Trans. Inf. Theory, vol. IT-9, no. 2, pp. 64-74, Apr. 1963.
13. W. Feller, An Introduction to Probability Theory and Its Application 2nd ed. New York: Wiley, 1971, vol. II.
14. R. G. Gallager, Information Theory and Reliable Communications. New York: Wiley, 1968.
15. C. Gomes, X. Xie, S. B. Wicker, and B. Selman, "Heavy tails, phase transitions, and the nature of cutoff," in Codes, Graphs, and Systems, R. E. Blahut and R. Koetter, Eds. Boston, MA: Kluwer, 2002.
16. D. Haccoun, "A branching process analysis of the average number of computations of the stack algorithm," IEEE Trans. Inf. Theory, vol. IT-30, no. 3, pp. 497-508, May 1984.
17. T. Hashimoto, "Computational moments for sequential decoding of convolutional codes," IEEE Trans. Inf. Theory, vol. IT-25, no. 5, pp. 584-591, Sep. 1979.
18. T. Hashimoto and S. Arimoto, "Deficient decoding of convolutional codes," Trans. IECE, vol. 63-A, pp. 90-97, Feb. 1980.
19. T. Hashimoto, "Tree coding of sources and channels," Ph.D. dissertation, Osaka Univ., Osaka, Japan, 1981.
20. I. M. Jacobs and E. R. Berlekamp, "A lower bound to the distribution of computation for sequential decoding," IEEE Trans. Inf. Theory, vol. IT-13, no. 2, pp. 167-174, Ap. 1967.
21. F. Jelinek, Probabilistic Information Theory. New York: McGraw-Hill, 1968.
22. F. Jelinek, "A fast sequential decoding algorithm using a stack," IBM J. Res. Devel., vol. 13, pp. 675-685, Nov. 1969.
23. R. Johannesson, "On the distribution of computation for sequential decoding using the stack algorithm," IEEE Trans. Inf. Theory, vol. IT-25, no. 3, pp. 323-331, May 1979.
24. R. Johannesson and K. Sh. Zigangirov, "On the distribution of the number of computations in any finite number of subtrees for the stack algorithm," IEEE Trans. Inf. Theory, vol. IT-31, no. 1, pp. 100-102, Jan. 1985.
25. R. Johannesson, K. Sh. Zigangirov, Fundamentals of Convolutional Coding. Piscataway, NJ: IEEE, 1999.
26. K. L. Jordan Jr, "The performance of sequential decoding in conjunction with efficient modulation," IEEE Trans. Commun. Technol., vol. COM-14, no. 6, pp. 283-297, Jun. 1966.
27. M. L. Katz, "The probability in the tail of a distribution," Ann. Math. Statist., vol. 34, pp. 312-318, 1963.
28. S. Lin and D. J. Costello Jr, Error Control Coding: Fundamentals and Applications. Englewood Cliffs, N.J.: Prentice-Hall, 1983.
29. L. Lovász, Combinatorial Problems and Exercises. Amsterdam. The Netherlands: North-Holland, 1979.
30. J. E. Savage, "Sequential decoding - The computation problem," Bell Syst. Tech. J., vol. 45, pp. 149-175, 1966.
31. A. J. Viterbi and J. K. Omura, Principles of Digital Communication and Coding. New York: McGraw-Hill, 1979.
32. J. M. Wozencraft and B. Reiffen, Sequential Decoding. Cambridge, MA: MIT Press, 1961.
33. K. Sh. Zigangirov, "Some sequential decoding procedures," Probl. Pered. Inf., vol. 2, pp. 13-25, 1966.