Back to Search
Start Over
On the Combinatorial Version of the Slepian–Wolf Problem.
- Source :
-
IEEE Transactions on Information Theory . Sep2018, Vol. 64 Issue 9, p6054-6069. 16p. - Publication Year :
- 2018
-
Abstract
- We study the following combinatorial version of the Slepian–Wolf coding scheme. Two isolated Senders are given binary strings $X$ and $Y$ , respectively; the length of each string is equal to $n$ , and the Hamming distance between the strings is at most $\alpha n$. The Senders compress their strings and communicate the results to the Receiver. Then, the Receiver must reconstruct both the strings $X$ and $Y$. The aim is to minimize the lengths of the transmitted messages. For an asymmetric variant of this problem (where one of the Senders transmits the input string to the Receiver without compression) with deterministic encoding, a nontrivial bound was found by Orlitsky and Viswanathany. In this paper, we prove a new lower bound for the schemes with syndrome coding, where at least one of the Senders uses linear encoding of the input string. For the combinatorial Slepian–Wolf problem with randomized encoding, the theoretical optimum of communication complexity was known earlier, even though effective protocols with optimal lengths of messages remained unknown. We close this gap and present a polynomial-time-randomized protocol that achieves the optimal communication complexity. [ABSTRACT FROM AUTHOR]
- Subjects :
- *SLEPIAN-Wolf coding
*HAMMING codes
*COMMUNICATION
*CODING theory
*ALGORITHMS
Subjects
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 64
- Issue :
- 9
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 131346507
- Full Text :
- https://doi.org/10.1109/TIT.2018.2854589