Noisy constrained capacity

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 986-990

  Jacquet, Philippe ^a   Seroussi, Gadiel ^b   Szpankowski, Wojciech ^c  

^a INRIA ROCQUENCOURT   (France)

^b HEWLETT PACKARD LABORATORIES   (United States)

^c Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SYMMETRIC CHANNEL; INTERNATIONAL SYMPOSIUM;

ARSENIC COMPOUNDS; DIFFERENTIAL EQUATIONS; INFORMATION THEORY; MARKOV PROCESSES; TECHNICAL PRESENTATIONS;

RANDOM PROCESSES;

EID: 51649110155     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2007.4557352     Document Type: Conference Paper

References (25)

1. D. M. Arnold, H.-A. Loeliger, P. O. Vontobel, A. Kavcic, W. Zeng, "Simulation-Based Computation of Information Rates for Channels With Memory," IEEE Trans. Information Theory, 52, 3498-3508, 2006.
2. D. Blackwell, "The entropy of functions of finite-state Markov chains," in Trans. First Prague Conf. Information Theory, Statistical Decision Functions, Random Processes, (Prague, Czechoslovakia), pp. 13-20, Pub. House Chechoslovak Acad. Sci., 1957.
3. J. Chen and P. Siegel, "Markov processes asymptotically achieve the capacity of finite-state intersymbol interference channels," Proc. ISIT 2004, p. 346, Chicago, 2004.
4. J. Fan, T. L. Poo, and B. Marcus, "Constraint Gain," IEEE Trans. Information Theory, 50, 1989-1999, 2001.
5. H. Furstenberg and H. Kesten, "Products of random matrices," Ann. Math. Statist, pp. 457-469, 1960.
6. G. Han and B. Marcus, "Analyticity of Entropy Rate of Hidden Markov Chains," IEEE Trans. Information Theory, 52, 5251-5266, 2006.
7. G. Han and B. Marcus, "Analyticity of Entropy Rate in Families of Hidden Markov Chains (II)," Proc. ISIT 2006, 103-107, Seattle, 2006.
8. G. Han and B. Marcus, "Capacity of noisy constrained channels, Proc. ISIT 2007, Nice, 2007.
9. T. Holliday, A. Goldsmith, and P. Glynn, "Capacity of Finite State Channels Based on Lyapunov Exponents of Random Matrices," IEEE Trans. Information Theory, 52, 3509-3532, 2006.
10. K. A. Schouhammer Immink, Codes for Mass Data Storage Systems, Shannon Foundation Publishers, Eindhoven, 2004.
11. P. Jacquet and W. Szpankowski, "Entropy computations via analytic depoissonization," IEEE Trans. Inform. Theory, 45, 1072-1081, 1999.
12. P. Jacquet, G. Seroussi, and W. Szpankowski, "On the Entropy of a Hidden Markov Process" (extended abstract), Data Compression Conference, 362-371, Snowbird, 2004.
13. P. Jacquet, G. Seroussi, and W. Szpankowski, "On the Entropy of a Hidden Markov Process" (full version), to appear in Theoretical Computer Science, 2007.
14. P. Jacquet and W. Szpankowski, "On (d,k) Sequences Not Containing a Given Word," Proc. ISIT 2006, Seattle, 2006.
15. S. Karlin and H. Taylor, A First Course in Stochastic Processes. New York: Academic Press, 1975.
16. B. Marcus, R. Roth and P. Siegel, "Constrained Systems and Coding for Recording Channels," Chap. 20 in Handbook of Coding Theory (eds. V. S. Pless and W. C. Huffman), Elsevier Science, 1998.
17. E. Ordentlich and T. Weissman, "New Bounds on th Entropy Rate of Hidden Markov Process," Information Theory Workshop, 117-122, San Antonio, 2004.
18. E. Ordentlich and T. Weissman, "On the optimality of symbol by symbol filtering and denoising," IEEE Trans. Information Theory, 52, 19-40, 2006.
19. V. Oseledec, "A multiplicative ergodic theorem," Trudy Moskov. Mat. Obshch., 1968.
20. E. Seneta, Non-Negative Matrices. New York: John Wiley & Sons, 1973.
21. S. Shamai (Shitz) and Y Kofman, "On the capacity of binary and Gaussian channels with run-length limited inputs," IEEE Trans. Commun., 38, 584-594, 1990.
22. W. Szpankowski, Average Case Analysis of Algorithms on Sequences. New York: John Wiley & Sons, Inc., 2001.
23. J. Tsitsiklis and V. Blondel, "The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate," Mathematics of Control, Signals, and Systems, 10, 31-40, 1997.
24. E. Zehavi and J. K. Wolf, "On runlength codes," IEEE Trans. Information Theory, 34, 45-54, 1988.
25. O. Zuk, I. Kanter and E. Domany, "Asymptotics of the Entropy Rate for a Hidden Markov Process," J. Stat. Phys., 121, 343-360, 2005.