Minimum redundancy zero-error source coding with side information

Author

Koulgi, Prashant ; Tuncel, Ertem ; Regunathan, Shankar ; Rose, Kenneth

Author_Institution

Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA

fYear

2001

fDate

2001

Firstpage

282

Abstract

We consider the design of instantaneous variable-length zero-error codes where the decoder has access to side information about the source, which is not available to the encoder. We show that finding the optimal code, which minimizes the expected codeword length, is an NP-hard problem. We derive an exponential-time optimal design algorithm. We also provide polynomial-time approximate algorithms, and discuss their average-case and worst-case performance guarantees

Keywords

computational complexity; minimisation; polynomial approximation; redundancy; source coding; variable length codes; NP-hard problem; average-case performance guarantee; codeword length minimization; exponential-time optimal design algorithm; instantaneous variable-length zero-error codes; minimum redundancy zero-error source coding; optimal code; polynomial-time approximate algorithms; side information; worst-case performance guarantee; Algorithm design and analysis; Binary codes; Decoding; Encoding; NP-hard problem; Polynomials; Probability distribution; Random variables; Redundancy; Source coding;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on

Conference_Location

Washington, DC

Print_ISBN

0-7803-7123-2

Type

conf

DOI

10.1109/ISIT.2001.936145

Filename

936145