Totally asynchronous Slepian-Wolf data compression
IEEE Transactions on Information Theory
Elements of information theory
Elements of information theory
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
Compression with Side Information Using Turbo Codes
DCC '02 Proceedings of the Data Compression Conference
On the construction of some capacity-approaching coding schemes
On the construction of some capacity-approaching coding schemes
DCC '04 Proceedings of the Conference on Data Compression
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Distributed source coding using syndromes (DISCUS): design and construction
IEEE Transactions on Information Theory
On code design for the Slepian-Wolf problem and lossless multiterminal networks
IEEE Transactions on Information Theory
Low-Complexity Approaches to Slepian–Wolf Near-Lossless Distributed Data Compression
IEEE Transactions on Information Theory
Hi-index | 0.00 |
We consider asynchronous Slepian-Wolf coding where the two encoders may not have completely accurate timing information to synchronize their individual block code boundaries, and propose LDPC code design in this scenario. A new information-theoretic coding scheme based on source splitting is provided, which can achieve the entire asynchronous Slepian-Wolf rate region. Unlike existing methods based on source splitting, the proposed scheme does not require common randomness at the encoder and the decoder, or the construction of super-letter from several individual symbols. We then design LDPC codes based on this new scheme, by applying the recently discovered source-channel code correspondence. Experimental results validate the effectiveness of the proposed method.