2014/01/05 by Nir Weinberger, Neri Merhav, Weinberger, Nir +1
Computer Science · Engineering · Mathematics · #Cellular Automata and Applications #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques #cs.IT #graph theory and CDMA systems #math.IT
paper · pdf · doi:10.48550/arxiv.1401.0892
Extended version of paper submitted to the IEEE Trans. on Information Theory. Presented in part in ISIT2014
openalex publication_date 2014/01/05 · arxiv created 2014/11/06 · arxiv updated 2014/11/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We analyze the optimal trade-off between the error exponent and the excess-rate exponent for variable-rate Slepian-Wolf codes. In particular, we first derive upper (converse) bounds on the optimal error and excess-rate exponents, and then lower (achievable) bounds, via a simple class of variable-rate codes which assign the same rate to all source blocks of the same type class. Then, using the exponent bounds, we derive bounds on the optimal rate functions, namely, the minimal rate assigned to each type class, needed in order to achieve a given target error exponent. The resulting excess-rate exponent is then evaluated. Iterative algorithms are provided for the computation of both bounds on the optimal rate functions and their excess-rate exponents. The resulting Slepian-Wolf codes bridge between the two extremes of fixed-rate coding, which has minimal error exponent and maximal excess-rate exponent, and average-rate coding, which has maximal error exponent and minimal excess-rate exponent.