Todd P. Coleman, Todd P. and Médard, Muriel and Effros, Michelle (2006) Time-sharing vs. source-splitting in the Slepian-Wolf problem: error exponents analysis. In: Data Compression Conference (DCC '06), Snowbird, UT, 28-30 March 2006. IEEE Computer Society , Los Alamitos, CA, pp. 53-62. ISBN 0 7695 2545 8 http://resolver.caltech.edu/CaltechAUTHORS:COLdcc06
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:COLdcc06
We discuss two approaches for decoding at arbitrary rates in the Slepian-Wolf problem - time sharing and source splitting - both of which rely on constituent vertex decoders. We consider the error exponents for both schemes and conclude that source-splitting is more robust at coding at arbitrary rates, as the error exponent for time-sharing degrades significantly at rates near vertices. As a by-product of our analysis, we exhibit an interesting connection between minimum mean-squared error estimation and error exponents.
|Item Type:||Book Section|
|Additional Information:||© Copyright 2006 IEEE. Reprinted with permission. The authors would like to thank Ralf Koetter for his initial suggestion to consider this comparison.|
|Subject Keywords:||decoding, error analysis, least mean squares methods|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Lindsay Cleary|
|Deposited On:||07 Feb 2007|
|Last Modified:||26 Dec 2012 09:31|
Repository Staff Only: item control page