2010/06/28 by Jun Muramatsu, Muramatsu, Jun, Shigeki Miyake +1 · 1 citation
Computer Science · Engineering · #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.1006.5271
openalex publication_date 2010/06/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The aim of this paper is to prove theorems for the Slepian-Wolf source coding and the broadcast channel coding (independent messages and no common message) based on the the notion of a stronger version of the hash property for an ensemble of functions. Since an ensemble of sparse matrices has a strong hash property, codes using sparse matrices can realize the achievable rate region. Furthermore, extensions to the multiple source coding and multiple output broadcast channel coding are investigated.