Universal decoding for channels with memory

IEEE Transactions on Information Theory

Volumn 44, Issue 5, 1998, Pages 1726-1745

  Feder, Meir ^a,b   Lapidoth, Amos ^a,b  

^a TEL AVIV UNIVERSITY   (Israel)

^b USA   (United States)

Author keywords

Compound channel, error exponent, finite state channel, gilbert elliott channel, intersymbol interference, random coding, universal decoding

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); CONVERGENCE OF NUMERICAL METHODS; DIGITAL COMMUNICATION SYSTEMS; INTERSYMBOL INTERFERENCE; SIGNAL ENCODING; SIGNAL RECEIVERS;

GILBERT-ELLIOTT CHANNEL;

DECODING;

EID: 0032162716     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.705540     Document Type: Article

References (41)

1. "GSM recommendations series 05, especially 05.03."
2. M. R. L. Hodges, "The GSM radio interface," Brit. Telecom. Technol. ]., vol. 8, pp. 31-13, Jan. 1990.
3. J. K. Omura and B. K. Levitt, "Coded error probability evaluation for antijam communication systems," IEEE Trans. Commun., vol. COM30, pp. 896-903, May 1982.
4. A. Lapidoth and S. Shamai (Shitz), "A lower bound on the biterror-rate resulting from mismatched Viterbi decoding," Europ. Trans. Telecommun., 1998, to be published.
5. I. Csiszâr and J. Körner, "Graph decomposition: A new key to coding theorems," IEEE Trans. Inform. Theory, vol. IT-27, pp. 5-12, Jan. 1981.
6. N. Merhav, G. Kaplan, A. Lapidoth, and S. Shamai (Shitz), "On information rates for mismatched decoders," IEEE Trans. Inform. Theory, vol. 40, pp. 1953-1967, Nov. 1994.
7. I. Csiszâr and P. Narayan, "Channel capacity for a given decoding metric," IEEE Trans. Inform. Theory, vol. 41, pp. 35-43, Jan. 1995.
8. V. B. Balakirsky, "A converse coding theorem for mismatched decoding at the output of binary-input memoryless channels," IEEE Trans. Inform. Theory, vol. 41, pp. 1889-1902, Nov. 1995.
9. A. Lapidoth, "Nearest-neighbor decoding for additive non-Gaussian noise channels," IEEE Trans. Inform. Theory, vol. 42, pp. 1520-1529, Sept. 1996.
10. _, "Mismatched decoding and the multiple-access channel," IEEE Trans. Inform. Theory, vol. 42, pp. 1439-1452, Sept. 1996.
11. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
12. A. Lapidoth and 1. E. Telatar, "The compound channel capacity of a class of finite state channels," IEEE Trans. Inform. Theory, vol. 44, pp. 973-983, May 1998.
13. E. L. Lehmann, Testing Statistical Hypotheses, 2nd ed. Pacific Grove, CA: Wadsworth & Brooks, 1991.
14. D. Blackwell, L. Breiman, and A. J. Thomasian, "The capacity of a class of channels," Ann. Math. Slat., vol. 30, pp. 1229-1241, Dec. 1959.
15. J. Wolfowitz, Coding Theorems of Information Theory, 3rd ed. Berlin, Germany: Springer-Verlag, 1978.
16. I. Csiszâr and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
17. W. L. Root and P. P. Varaiya, "Capacity of classes of Gaussian channels," SIAM J. Appl. Math., vol. 16, pp. 1350-1393, Nov. 1968.
18. I. G. Stiglitz, "Coding for a class of unknown channels," IEEE Trans. Inform. Theory, vol. IT-12, pp. 189-195, Apr. 1966.
19. J. Ziv, "Universal decoding for finite-state channels," IEEE Trans. Inform. Theory, vol. IT-31, pp. 453-460, July 1985.
20. V. D. Goppa, "Nonprobabalistic mutual information without memory," Probl. Contr. Inform. Theory, vol. 4, pp. 97-102, 1975.
21. N. Merhav, "Universal decoding for memoryless Gaussian channels with a deterministic interference," IEEE Trans. Inform. Theory, vol. 39, pp. 1261-1269, July 1993.
22. A. J. Goldsmith and P. P. Varaiya, "Capacity, mutual information, and coding for finite-state Markov channels," IEEE Trans. Inform. Theory, vol. 42, pp. 868-886, May 1996.
23. E. N. Gilbert, "Capacity of a burst-noise channel," Bell Syst. Tech. J., vol. 39, pp. 1253-1266, Sept. 1960.
24. E. O. Elliott, "Estimates of error rates for codes on burst-noise channels," Bell Syst. Tech. J., vol. 42, pp. 1977-1997, Sept. 1963.
25. M. Mushkin and I. Bar-David, "Capacity and coding for the GilbertElliott channel," IEEE Trans. Inform. Theory, vol. IT-35, pp. 1277-1290, Nov. 1989.
26. G. Bratt, "Sequential decoding for the Gilbert-Elliott channel-Strategy and analysis," Ph.D. dissertation, Lund Univ., Lund, Sweden, June 1994.
27. C. E. Shannon, "Probability of error for optimal codes in a Gaussian channel," Bell Syst. Tech. J., vol. 38, pp. 611-656, 1959.
28. M. Weinberger, J. Ziv, and A. Lempel, "On the optimal asymptotic performance of universal ordering and of discrimination of individual sequences," IEEE Trans. Inform. Theory, vol. 38, pp. 380-385, Mar. 1992.
29. A. Lapidoth and J. Ziv, "On the universality of the LZ-based decoding algorithm," this issue, pp. 1746-1755.
30. I. Csiszâr, "Arbitrarily varying channel with general alphabets and states," IEEE Trans. Inform. Theory, vol. 38, pp. 1725-1742, Nov. 1992.
31. D. Blackwell, L. Breiman, and A. J. Thomasian, "The capacities of certain channel classes under random coding," Ann. Math. Stat., vol. 31, pp. 558-567, 1960.
32. B. Y. Ryabko, "Twice-universal coding," Probl. Inform. Transm., pp. 173-177, July-Sept. 1984.
33. M. Feder and N. Merhav, "Hierarchical universal coding," IEEE Trans. Inform. Theory, vol. 42, pp. 1354-1364, Sept. 1996.
34. A. J. Viterbi and J. K. Omura, Principles of Digital Communication and Coding. New York: McGraw-Hill, 1979.
35. A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications. Boston, MA: Jones and Bartlett, 1993.
36. I. Csiszâr and P. Narayan, "The capacity of the arbitrarily varying channel revisited: Capacity, constraints," IEEE Trans. Inform. Theory, vol. 34, pp. 181-193, Jan. 1988.
37. T. Ericson, "Exponential error bounds for random codes in the arbitrarily varying channel," IEEE Trans. Inform. Theory, vol. IT-31, pp. 42-48, Jan. 1985.
38. J. Pokorny and H. Wallmeier, "Random coding bound and codes produced by permutations for the multiple-access channel," IEEE Trans. Inform. Theory, vol. IT-31, pp. 741-750, Nov. 1985.
39. Y. S. Liu and B. L. Hughes, "A new universal random coding bound for the multiple-access channel," IEEE Trans. Inform. Theory, vol. 42, pp. 376-386, Mar. 1996.
40. A. Lapidoth and J. Ziv, "Universal sequential decoding," presented at the 1998 Information Theory Workshop, Killarney, Co. Kerry, Ireland, June 22-26, 1998.
41. T. M. Cover and E. Ordentlich, "Universal portfolios with side information," IEEE Trans. Inform. Theory, vol. 42, pp. 348-363, Mar. 1996.