Low complexity code design for lossless and near-lossless side information source codes

Data Compression Conference Proceedings

Volumn 2003-January, Issue , 2003, Pages 3-12

  Zhao, Qian ^a   Effros, Michelle ^a  

^a California Institute of Technology   (United States)

Author keywords

Data compression

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; DECODING; DESIGN; OPTIMAL SYSTEMS; OPTIMIZATION; POLYNOMIALS;

INFORMATION SOURCES; NEAR-LOSSLESS; OPTIMAL DESIGN; OPTIMAL SOLUTIONS; POLYNOMIAL COMPLEXITY; PROBABILITY MASS FUNCTION; SIDE INFORMATION; THEORETICAL LIMITS;

DATA COMPRESSION;

EID: 84942245925     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2003.1193991     Document Type: Conference Paper

References (12)

1. H. S. Witsenhausen. The zero-error side information problem and chromatic numbers. IEEE Transactions on Information Theory, 22:592-593, 1976.
2. N. Alon and A. Orlitsky. Source coding and graph entropies. IEEE Transactions on Information Theory, 42(5):1329-1339, September 1996.
3. A. Kh. Al Jabri and S. Al-Issa. Zero-error codes for correlated information sources. In Proceedings of Cryptography, pages 17-22, Cirencester,UK, December 1997.
4. S. S. Pradhan and K. Ramchandran. Distributed source coding using syndromes (DISCUS) design and construction. In Proceedings of the Data Compression Conference, pages 158-167, Snowbird, UT, March 1999.
5. Y. Yan and T. Berger. On instantaneous codes for zero-error coding of two correlated sources. In Proceedings of the IEEE International Symposium on Information Theory, page 344, Sorrento, Italy, June 2000.
6. Q. Zhao and M. Effros. Optimal code design for lossless and near-lossless source coding in multiple access networks. In Proceedings of the Data Compression Conference, pages 263-272, Snowbird, UT, March 2001. IEEE.
7. Q. Zhao and M. Effros. Lossless source coding for multiple access networks. In Proceedings of the IEEE International Symposium on Information Theory, page 285, Washington, DC, June 2001.
8. Q. Zhao and M. Effros. Lossless and near lossless source coding for multiple access networks. IEEE Transactions on Information Theory, January 2003.
9. P. Koulgi, E. Tuncel, S. Regunathan, and K. Rose. Minimum redundancy zero-error source coding with side information. In Proceedings of the IEEE International Symposium on Information Theory, page 282, Washington DC, USA, June 2001.
10. S. Even. Graph Algorithms. Computer Science Press, Potomac, Maryland, 1979.
11. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, 220:671-680, May 1983.
12. J. Vaisey and A. Gersho. Simulated annealing and codebook design. In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, pages 1176-1179, April 1988.