We propose a new scheme for symmetric Slepian-Wolf coding of correlated binary sources. Unlike previous designs that employ capacity-achieving channel codes, the proposed scheme is based on arithmetic codes with error correction capability. We define a time-sharing version of a distributed arithmetic coder, and a soft joint decoder. Experimental results on two sources show that, for short block length, the proposed scheme outperforms the symmetric turbo code design in (Stankovic et al., 2006)
We address the problem of distributed source coding of binary sources with side information at the d...
We study the transmission of correlated sources over discrete memoryless (DM) multiple-access-relay ...
Multiterminal (MT) source coding refers to separate lossy encoding and joint decoding of multiple co...
We propose a constructive approach for distributed source coding of correlated binary sources using ...
A Slepian-Wolf coding scheme that can achieve arbitrary rate allocation among two encoders was outli...
This paper describes a family of codes based on arithmetic coding with overlapping intervals. These ...
Abstract – This paper proposes a practical coding scheme for the Slepian-Wolf problem of separate en...
We address distributed source coding with decoder side information, when the decoder observes the so...
A Slepian-Wolf coding scheme for compressing two uniform memoryless binary sources using a single ch...
This correspondence considers the use of punctured quasi-arithmetic (QA) codes for the Slepian–Wolf...
In this paper, we propose a technique for coding the data from multiple correlated binary sources, w...
We study the transmission of correlated sources over multiple-access-relay channels, in which both t...
This paper considers the problem of communicating correlated information from multiple source nodes ...
Abstract—We study the transmission of correlated sources over multiple-access-relay channels, in whi...
The Slepian-Wolf (SW) cooperation proposed in [1] is probably the first practical cooperative schem...
We address the problem of distributed source coding of binary sources with side information at the d...
We study the transmission of correlated sources over discrete memoryless (DM) multiple-access-relay ...
Multiterminal (MT) source coding refers to separate lossy encoding and joint decoding of multiple co...
We propose a constructive approach for distributed source coding of correlated binary sources using ...
A Slepian-Wolf coding scheme that can achieve arbitrary rate allocation among two encoders was outli...
This paper describes a family of codes based on arithmetic coding with overlapping intervals. These ...
Abstract – This paper proposes a practical coding scheme for the Slepian-Wolf problem of separate en...
We address distributed source coding with decoder side information, when the decoder observes the so...
A Slepian-Wolf coding scheme for compressing two uniform memoryless binary sources using a single ch...
This correspondence considers the use of punctured quasi-arithmetic (QA) codes for the Slepian–Wolf...
In this paper, we propose a technique for coding the data from multiple correlated binary sources, w...
We study the transmission of correlated sources over multiple-access-relay channels, in which both t...
This paper considers the problem of communicating correlated information from multiple source nodes ...
Abstract—We study the transmission of correlated sources over multiple-access-relay channels, in whi...
The Slepian-Wolf (SW) cooperation proposed in [1] is probably the first practical cooperative schem...
We address the problem of distributed source coding of binary sources with side information at the d...
We study the transmission of correlated sources over discrete memoryless (DM) multiple-access-relay ...
Multiterminal (MT) source coding refers to separate lossy encoding and joint decoding of multiple co...