Journal article
On the Redundancy of Slepian–Wolf Coding
Abstract
In this paper, the redundancy of both variable and fixed rate Slepian–Wolf coding is considered. Given any jointly memoryless source-side information pair $\{(X_i, Y_i)\}_{i=1}^{\infty}$ with finite alphabet, the redundancy $R^n(\epsilon_n)$ of variable rate Slepian–Wolf coding of $X_1^n$ with decoder only side information $Y_1^n$ depends on both the block length $n$ and the decoding block error probability $\epsilon_n$, and is defined as the …
Authors
He D-K; Lastras-Montaño LA; Yang E-H; Jagmohan A; Chen J
Journal
IEEE Transactions on Information Theory, Vol. 55, No. 12, pp. 5607–5627
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Publication Date
December 1, 2009
DOI
10.1109/tit.2009.2032803
ISSN
0018-9448