2010/01/22 by Rick Ma, Ma, Rick, Samuel Cheng +1
Computer Science · Engineering · #Algorithms and Data Compression #Chaos-based Image/Signal Encryption #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.1001.4072
openalex publication_date 2010/01/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider Slepian-Wolf (SW) coding of multiple sources and extend the packing bound and the notion of perfect code from conventional channel coding to SW coding with more than two sources. We then introduce Hamming Codes for Multiple Sources (HCMSs) as a potential solution of perfect SW coding for arbitrary number of terminals. Moreover, we study the case with three sources in detail. We present the necessary conditions of a perfect SW code and show that there exists infinite number of HCMSs. Moreover, we show that for a perfect SW code with sufficiently long code length, the compression rates of different sources can be trade-off flexibly. Finally, we relax the construction procedure of HCMS and call the resulting code generalized HCMS. We prove that every perfect SW code for Hamming sources is equivalent to a generalized HCMS.