Symmetric and a-symmetric slepian-wolf codes with systematic and non-systematic linear codes
نویسندگان
چکیده
منابع مشابه
"Real" Slepian-Wolf codes
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field achieve the classical Slepian-Wolf rate region. For finite alphabets we show that decoding is equivalent to solving an integer program. The techniques used may be of independent interest for code design for a wide class...
متن کاملNew systematic easy decoding symmetric rank codes
A family of rank-metric codes over binary fields with lengths Ns = 2, s = 0, 1, . . . , is constructed. Codes of length Ns are designed recursively from codes of length Ns−1. This provides very high degree of symmetry of code matrices. In turn, it allows to decode corrupted received matrices recursively starting with small lengths. The construction allows to use many simple algorithms for decod...
متن کاملTurbo Codes with Non-Systematic Constituent Codes∗
Turbo codes are usually constructed using systematic recursive convolutional codes (SRCC’s) as constituent codes. In this paper, we introduce a new class of turbo codes that uses nonsystematic recursive convolutional codes (NSRCC’s) as constituent codes. A systematic constituent code then becomes a particular case of this more general class. The use of this larger class of constituent codes enh...
متن کاملNon-Asymptotic Performance of Symmetric Slepian-Wolf Coding
Like most results in information theory, the classical Slepian-Wolf theorem is asymptotic. We characterize how quickly the limits put forth by information theory can be reached. Our contribution is two-fold. First, we investigate the non-asymptotic regime for two binary sources that generate sequences with a symmetric joint distribution. Second, we provide tight converse and achievable bounds a...
متن کاملPolar Codes for Nonasymmetric Slepian-Wolf Coding
A method to construct nonasymmetric distributed source coding (DSC) scheme using polar codes which can achieve any point on the dominant face of the Slepian–Wolf (SW) rate region for sources with uniform marginals is considered. In addition to nonasymmetric case, we also discuss and show explicitly how asymmetric and single source compression is done using successive cancellation (SC) polar dec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2005
ISSN: 1089-7798
DOI: 10.1109/lcomm.2005.1375242