2013/05/08 by Duo Xu, Xu, Duo
Computer Science · Engineering · Mathematics · #Cellular Automata and Applications #Chaos-based Image/Signal Encryption #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1305.1730
arxiv created 2013/05/08 · openalex publication_date 2013/05/08 · arxiv updated 2013/05/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
[Draft] In this paper, the redundancy of Slepian Wolf coding is revisited. Applying the random binning and converse technique in \citeyang, the same results in \citehe are obtained with much simpler proofs. Moreover, our results reflect more details about the high-order terms of the coding rate. The redundancy is investigated for both fixed-rate and variable-rate cases. The normal approximation (or dispersion) can also be obtained with minor modification.