Zero-error source-channel coding with side information

IEEE Transactions on Information Theory

Volumn 52, Issue 10, 2006, Pages 4626-4629

  Nayak, Jayanth ^b   Tuncel, Ertem ^a,c   Rose, Kenneth ^a,d  

^a IEEE

^b CAMPUS DE BEAULIEU   (France)

^c University of California Riverside   (United States)

^d University of California   (United States)

Author keywords

Graph homomorphisms; Lov sz theta function; Source channel separation; Zero error coding

Indexed keywords

ASYMPTOTIC ANALYSIS; ERROR ANALYSIS; INFORMATION THEORY; PROBLEM SOLVING; SIGNAL RECEIVERS;

GRAPH HOMOMORPHISMS; LOVÁSZ THETA FUNCTION; SOURCE-CHANNEL SEPARATION; ZERO-ERROR CODING;

CHANNEL CODING;

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

References (15)

1. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-423, 1948.
2. S. Vembu, S. Verdú, and Y. Steinberg, "The source-channel separation theorem revisited," IEEE Trans. Inf. Theory, vol. 41, no. 1, pp. 44-54, Jan. 1995.
3. C. E. Shannon, "The zero error capacity of a noisy channel," IRE Trans. Inf. Theory, vol. PGIT-2, no. 3, pp. 8-19, Sep. 1956.
4. D. Slepian and J. K. Wolf, "Noiseless coding of correlated information sources," IEEE Trans. Inf. Theory, vol. IT-19, no. 4, pp. 471-480, Jul. 1973.
5. S. Shamai (Shitz) and S. Verdú, "Capacity of channels with side information," Europ. Trans. Telecommun., vol. 6, no. 5, pp. 587-600, Sep./Oct. 1995.
6. L. Lovász, "On the Shannon capacity of a graph," IEEE Trans. Inf. Theory, vol. IT-25, no. 1, pp. 1-7, Jan. 1979.
7. N. Alon, "The Shannon capacity of a union," Combinatorica, vol. 18, no. 3, pp. 301-310, 1998.
8. J. H. van Lint and R. M. Wilson, A Course in Combinatorics. Cambridge, U.K.: Cambridge Univ. Press, 1992.
9. D. E. Knuth, "The sandwich theorem," Electron. J. Combin., vol. 1, 1994.
10. H. S. Witsenhausen, "The zero-error side information problem and chromatic numbers," IEEE Trans. Inf. Theory, vol. IT-22, no. 6, pp. 592-593, Nov. 1976.
11. K. Marton, "On the Shannon capacity of probabilistic graphs," J. Comb. Theory, Ser. B, vol. 57, no. 2, pp. 183-195, Mar. 1993.
12. W. Haemers, "On some problems of Lovász concerning the Shannon capacity of a graph," IEEE Trans. Inf. Theory, vol. IT-25, no. 2, pp. 231-232, Mar. 1979.
13. J. L. R. Alfonsín and B. A. Reed, Eds., Perfect Graphs. West Sussex, England: Wiley, 2001.
14. M. R. Garey and D. S. Johnson, Computers and Intractability. San Francisco, CA: Freeman, 1979.
15. P. Hell and J. Nešetřil, "On the complexity of H-coloring," J. Comb. Theory, Ser. B, vol. 48, pp. 92-110, 1990.