Results 1  10
of
109
Finite Blocklength SlepianWolf Coding
"... Abstract—We characterize the fundamental limits for distributed lossless source coding (SlepianWolf) in the finite blocklength regime. We introduce a fundamental quantity known as the entropy dispersion matrix, which is analogous to scalar dispersion quantities. We show that if this matrix is pos ..."
Abstract
 Add to MetaCart
Abstract—We characterize the fundamental limits for distributed lossless source coding (SlepianWolf) in the finite blocklength regime. We introduce a fundamental quantity known as the entropy dispersion matrix, which is analogous to scalar dispersion quantities. We show that if this matrix
The Dispersion of SlepianWolf Coding
"... Abstract—We characterize secondorder coding rates (or dispersions) for distributed lossless source coding (the SlepianWolf problem). We introduce a fundamental quantity known as the entropy dispersion matrix, which is analogous to scalar dispersion quantities. We show that if this matrix is posit ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract—We characterize secondorder coding rates (or dispersions) for distributed lossless source coding (the SlepianWolf problem). We introduce a fundamental quantity known as the entropy dispersion matrix, which is analogous to scalar dispersion quantities. We show that if this matrix
On the redundancy of SlepianWolf coding
 IEEE Trans. Inf. Theory
, 2009
"... Abstract—In this paper, the redundancy of both variable and fixed rate Slepian–Wolf coding is considered. Given any jointly memoryless sourceside information pair with finite alphabet, the redundancy of variable rate Slepian–Wolf coding of with decoder only side information depends on both th ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
Abstract—In this paper, the redundancy of both variable and fixed rate Slepian–Wolf coding is considered. Given any jointly memoryless sourceside information pair with finite alphabet, the redundancy of variable rate Slepian–Wolf coding of with decoder only side information depends on both
“Real ” SlepianWolf Codes
"... Abstract — We provide a novel achievability proof of the SlepianWolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field achieve the classical SlepianWolf rate region. For finite alphabets we show that decoding is equivalent to sol ..."
Abstract
 Add to MetaCart
Abstract — We provide a novel achievability proof of the SlepianWolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field achieve the classical SlepianWolf rate region. For finite alphabets we show that decoding is equivalent
Redundancy rates of SlepianWolf coding
 Proc. 42nd Annual Allerton Conf. on Comm., Control, and Computing
, 2004
"... The results of Shannon theory are asymptotic and do not reflect the finite codeword lengths used in practice. Recent progress in design of distributed source codes, along with the need for distributed compression in sensor networks, has made it crucial to understand how quickly distributed communica ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
by K(ɛ) / √ n, where ɛ is the probability of error. We also study the cost of universality in SlepianWolf coding, and propose a universal variable rate scheme wherein the encoder for x receives PY = 1 � i yi. For PY < 0.5, our redundancy rate is K ′ (ɛ) / √ n above the empirical conditional
Coding for the SlepianWolf problem with turbo codes
 in Proc. GlobeCom’01
, 2001
"... Abstract This paper proposes a practical coding scheme for the SlepianWolf problem of separate encoding of correlated sources. Finitestate machine (FSM) encoders, concatenated in parallel, are used at the transmit side and an iterative turbo decoder is applied at the receiver. Simulation results ..."
Abstract

Cited by 63 (0 self)
 Add to MetaCart
Abstract This paper proposes a practical coding scheme for the SlepianWolf problem of separate encoding of correlated sources. Finitestate machine (FSM) encoders, concatenated in parallel, are used at the transmit side and an iterative turbo decoder is applied at the receiver. Simulation
Variablerate universal SlepianWolf coding with feedback
 Proc. 39th Asilomar Conf. on Signals, Systems, and Computers
, 2005
"... Abstract — Traditional SlepianWolf coding assumes known statistics and relies on asymptotically long sequences. However, in practice the statistics are unknown, and the input sequences are of finite length. In this finite regime, we must allow a nonzero probability of codeword error ɛ and also pay ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract — Traditional SlepianWolf coding assumes known statistics and relies on asymptotically long sequences. However, in practice the statistics are unknown, and the input sequences are of finite length. In this finite regime, we must allow a nonzero probability of codeword error ɛ and also
Channel coding rate in the finite blocklength regime
 IEEE TRANS. INF. THEORY
, 2010
"... This paper investigates the maximal channel coding rate achievable at a given blocklength and error probability. For general classes of channels new achievability and converse bounds are given, which are tighter than existing bounds for wide ranges of parameters of interest, and lead to tight appro ..."
Abstract

Cited by 240 (30 self)
 Add to MetaCart
This paper investigates the maximal channel coding rate achievable at a given blocklength and error probability. For general classes of channels new achievability and converse bounds are given, which are tighter than existing bounds for wide ranges of parameters of interest, and lead to tight
SlepianWolf coding over cooperative relay networks
 IEEE Trans. Inf. Theory
, 2011
"... This paper deals with the problem of multicasting a set of discrete memoryless correlated sources (DMCS) over a cooperative relay network. Necessary conditions with cutset interpretation are presented. A Joint sourceWynerZiv encoding/sliding window decoding scheme is proposed, in which decoding a ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
field deterministic network. Also, in Gaussian cooperative networks, it is shown that reliable transmission of all DMCS whose SlepianWolf region intersects the cutset bound region within a constant number of bits, is feasible. In particular, all results of the paper are specialized to obtain an achievable rate
The ratedistortion function for source coding with side information at the decoder
 IEEE Trans. Inform. Theory
, 1976
"... AbstractLet {(X,, Y,J}r = 1 be a sequence of independent drawings of a pair of dependent random variables X, Y. Let us say that X takes values in the finite set 6. It is desired to encode the sequence {X,} in blocks of length n into a binary stream*of rate R, which can in turn be decoded as a seque ..."
Abstract

Cited by 1060 (1 self)
 Add to MetaCart
. This is in contrast to the situation treated by Slepian and Wolf [5] where, for arbitrarily accurate reproduction of {X,}, i.e., d = E for any E> 0, knowledge of the side information at the encoder does not allow a reduction of the transmission rate.
Results 1  10
of
109