On zero-error source coding with decoder side information

IEEE Transactions on Information Theory

Volumn 49, Issue 1, 2003, Pages 99-111

  Koulgi, Prashant ^a   Tuncel, Ertem ^a   Regunathan, Shankar L ^b   Rose, Kenneth ^a  

^a Santa Barbara   (United States)

^b MICROSOFT   (United States)

Author keywords

Complementary graph entropy; Graph coloring; Graph entropy; Lossless coding; N P completeness; Side information; Slepian Wolf; Zero error capacity

Indexed keywords

ALGORITHMS; DECODING; GRAPH THEORY; POLYNOMIALS; PROBABILITY DISTRIBUTIONS;

ENCODERS;

CODING ERRORS;

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

References (29)

1. N. Alon and A. Orlitsky, "Source coding and graph entropies," IEEE Trans. Inform. Theory, vol. 42, pp. 1329-1339, Sept. 1996.
2. _,"A lower bound on the expected length of one-to-one codes," IEEE Trans. Inform. Theory, vol. 40, pp. 1670-1672, Sept. 1994.
3. C. Berge, Graphs and Hypergraphs. Amsterdam, The Netherlands: North-Holland, 1973.
4. T. Berger, Rate Distortion Theory-A Mathematical Basis for Data Compression. Englewood Cliffs, NJ: Prentice-Hall, 1971.
5. R. E. Blahut, "Computation of channel capacity and rate-distortion functions," IEEE Trans. Inform. Theory, vol. IT-18, pp. 460-473, July 1972.
6. B. Bollobás, Graph Theory. An Introductory Course. Berlin/Heidelberg/New York: Springer-Verlag, 1979.
7. E. J. Cockayne and S. T. Hedetniemi, "Toward a theory of domination in graphs," Networks, vol. 7, no. 3, pp. 247-261, Fall 1977.
8. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
9. I. Csiszár and J. Körner, "On the capacity of the arbitrarily varying channel for maximum probability of error," Z. Wahrsch. Verw. Gebiete, vol. 57, pp. 87-101, 1981.
10. I. Csiszár, J. Körner, L. Lovász, K. Marton, and G. Simonyi, "Entropy splitting for antiblocking corners and perfect graphs," Combinatorica, vol. 10, no. 1, 1990.
11. I. Csiszár and J. Körner, Information Theory. Coding Theorems for Dis-crete Memoryless Sources. New York: Academic, 1982.
12. T. Feder, E. Kushilevitz, M. Naor, and N. Nisan, "Amortized communication complexity," SIAM J. Comput., vol. 24, no. 4, pp. 736-750, Aug. 1995.
13. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
14. G. R. Grimmet and C. J. H. McDiarmid, "On coloring random graphs," Math. Proc. Cambr. Philos. Soc., vol. 77, pp. 313-324, 1975.
15. M. M. Halldórsson, "A still better performance guarantee for approximate graph coloring," Inform. Processing Lett., vol. 45, pp. 19-23, 1993.
16. D. Huffman, "A method for the construction of minimum redundancy codes," Proc. IRE, vol. 40, pp. 1098-1101, Sept. 1952.
17. A. Kh. Al Jabri and S. Al-Issa, "Zero-error codes for correlated information sources," in Proc. Cryptography, Cirencester, U.K., Dec. 1997, pp. 17-22.
18. J. Körner, "Coding of an information source having ambiguous alphabet and the entropy of graphs," in Proc. 6th Prague Conf. Information Theory. Prague, Czechoslovakia: Academia, 1973, pp. 411-425.
19. J. Körner and G. Longo, "Two-step encoding of finite memoryless sources," IEEE Trans. Inform. Theory, vol. IT-19, pp. 778-782, Nov. 1973.
20. L. Lovász, "Perfect graphs," in More Selected Topics in Graph Theory, L. W. Beineke and R. J. Wilson, Eds. New York/London: Academic, 1983, pp. 55-87.
21. _, "On the Shannon capacity of a graph," IEEE Trans. Inform. Theory, vol. IT-25, pp. 1-7, Jan. 1979.
22. K. Marton, "On the Shannon capacity of probabilistic graphs," J. Comb. Theory, ser. B, vol. 57, no. 2, Mar. 1993.
23. S. S. Pradhan and K. Ramchandran, "Distributed source coding using syndromes (DISCUS): Design and construction," in Proc. Data Compr. Conf., Snowbird, UT, Mar. 1999, pp. 158-167.
24. C. E. Shannon, "The zero-error capacity of a noisy channel," IRE Trans. Inform. Theory, vol. IT-2, pp. 8-19, Sept. 1956.
25. G. Simonyi, "Graph entropy: A survey," in DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1995, vol. 20, pp. 399-441.
26. D. Slepian and J. K. Wolf, "Noiseless coding of correlated information sources," IEEE Trans. Inform. Theory, vol. IT-19, pp. 471-480, July 1973.
27. H. S. Witsenhausen, "The zero-error side information problem and chromatic numbers," IEEE Trans. Inform. Theory, vol. IT-22, pp. 592-593, Sept. 1976.
28. Y. Yan and T. Berger, "On instantaneous codes for zero-error coding of two correlated sources," in Proc. IEEE Int. Symp. Information Theory, Sorrento, Italy, June 2000, p. 344.
29. Q. Zhao and M. Effros, "Optimal code design for lossless and near lossless source coding in multiple access networks," in Proc. Data Compression Conf., Snowbird, UT Mar. 2001, pp. 263-272.