Dispersion of the Gilbert-Elliott channel

IEEE Transactions on Information Theory

Volumn 57, Issue 4, 2011, Pages 1829-1848

  Polyanskiy, Yury ^a   Poor, H Vincent ^a   Verdú, Sergio ^a  

^a Princeton University   (United States)

Author keywords

Channel capacity; coding for noisy channels; finite blocklength regime; Gilbert Elliott channel; hidden Markov models; non ergodic channels; Shannon theory

Indexed keywords

CODING FOR NOISY CHANNELS; FINITE BLOCKLENGTH REGIME; GILBERT-ELLIOTT CHANNEL; NON-ERGODIC CHANNELS; SHANNON THEORY;

DISPERSIONS; HIDDEN MARKOV MODELS; SPECTRAL DENSITY;

CHANNEL CAPACITY;

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

References (16)

1. Y. Polyanskiy, H. V. Poor, and S. Verdú, "Channel coding rate in the finite blocklength regime," IEEE Trans. Inf. Theory, vol. 56, no. 5, pp. 2307-2359, May 2010.
2. E. Biglieri, J. Proakis, and S. Shamai (Shitz), "Fading channels: Information- theoretic and communication aspects," IEEE Trans. Inf. Theory (50th Anniversary Issue), vol. 44, no. 6, pp. 2619-2692, Oct. 1998.
3. E. N. Gilbert, "Capacity of burst-noise channels," Bell Syst. Tech. J., vol. 39, pp. 1253-1265, Sep. 1960.
4. E. O. Elliott, "Estimates of error rates for codes on burst-noise channels," Bell Syst. Tech. J., vol. 42, pp. 1977-1997, Sept. 1963.
5. M. Mushkin and I. Bar-David, "Capacity and coding for the Gilbert-Elliott channels," IEEE Trans. Inf. Theory, vol. 35, no. 6, pp. 1277-1290, 1989.
6. R. G. Gallager, "A simple derivation of the coding theorem and some applications," IEEE Trans. Inf. Theory, vol. 11, no. 1, pp. 3-18, 1965.
7. S. Verdú, EE528-Information Theory, Lecture Notes. Princeton, NJ: Princeton University, 2009.
8. A. N. Tikhomirov, "On the convergence rate in the central limit theorem for weakly dependent random variables," Theor. Probabil. and Its Applic., vol. XXV, no. 4, 1980.
9. Y. Polyanskiy,H.V. Poor, and S.Verdú, "Dispersion of Gaussian channels," in Proc. IEEE Int. Symp. Information Theory (ISIT), Seoul,Korea, 2009.
10. I. A. Ibragimov, "Some limit theorems for stationary processes," Theor. Probabil. and Its Applic., vol. 7, no. 4, 1962.
11. J. C. Kieffer, "Epsilon-capacity of binary symmetric averaged channels," IEEE Trans. Inf. Theory, vol. 53, no. 1, pp. 288-303, 2007. (Pubitemid 46056078)
12. S.Verdú and T. S. Han, "A general formula for channel capacity," IEEE Trans. Inf. Theory, vol. 40, no. 4, pp. 1147-1157, 1994.
13. W. Feller, An Introduction to Probability Theory and Its Applications, Volume II, 2nd ed. New York: Wiley, 1971.
14. G. Birkhoff, "Extensions of Jentzsch's theorem," Trans. AMS, vol. 85, pp. 219-227, 1957.
15. T. Holliday, A. Goldsmith, and P. Glynn, "Capacity of finite state channels based on Lyapunov exponents of random matrices," IEEE Trans. Inf. Theory, vol. 52, no. 8, pp. 3509-3532, Aug. 2006. (Pubitemid 44145113)
16. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.