3 research outputs found
Zero-error Slepian-Wolf Coding of Confined Correlated Sources with Deviation Symmetry
In this paper, we use linear codes to study zero-error Slepian-Wolf coding of
a set of sources with deviation symmetry, where the sources are generalization
of the Hamming sources over an arbitrary field. We extend our previous codes,
Generalized Hamming Codes for Multiple Sources, to Matrix Partition Codes and
use the latter to efficiently compress the target sources. We further show that
every perfect or linear-optimal code is a Matrix Partition Code. We also
present some conditions when Matrix Partition Codes are perfect and/or
linear-optimal. Detail discussions of Matrix Partition Codes on Hamming sources
are given at last as examples.Comment: submitted to IEEE Trans Information Theor
Hamming coding for Multiple Sources
We introduce Hamming Codes for Multiple Sources (HCMSs) as a potential solution of perfect Slepian-Wolf (SW) coding for arbitrary number of terminals. Moreover, we study the case with three sources in detail. We present the necessary conditions of a perfect SW code and show that there exists infinite number of HCMSs. Moreover, we show that for perfect SW code with sufficiently long code length, the compression rates of different sources can be trade-off flexibly. © 2010 IEEE