Zero-error codes for correlated information sources

23Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Stepian and Wolf [2] gave a characterization for the compression region of distributed correlated sources. Their result is for codes with a decoding probability of error approaching zero as the code length is increased. Of interest in many applications is to find codes for which the probability of error is exactly zero. For this latter case, block codes using the zero-error information between the sources have been proposed by Witsenhausen [3]. Better codes, however, can be obtained by further exploitation of the statistical dependency impeded in the correlation information. In this paper variable-length zero-error codes are proposed that are generally more efficient than Witsenhausen codes. A method for their construction is presented and an example demonstrating such construction with the achieved rate region axe given.

Cite

CITATION STYLE

APA

Al Jabri, A. K., & Al-Issa, S. (1997). Zero-error codes for correlated information sources. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1355, pp. 17–22). Springer Verlag. https://doi.org/10.1007/bfb0024445

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free