2017/04/24 by Yu-Chih Huang, Yi Hong, Huang, Yu-Chih +3
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Technologies #Algorithm #Broadcasting (networking) #Code (set theory) #Coding (social sciences) #Computer network #Computer science #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #Index (typography) #Information Theory (cs.IT) #Mathematics #Programming language #Statistics #Theoretical computer science #World Wide Web #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1704.07014
5 pages, 2 figures. Accepted for publication in 2017 IEEE ISIT
arxiv created 2017/04/24 · openalex publication_date 2017/04/24 · arxiv updated 2017/04/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study the problem of constructing good space-time codes for broadcasting K independent messages over a MIMO network to L users, where each user demands all the messages and already has a subset of messages as side information. As a first attempt, we consider the 2× 2 case and propose golden-coded index coding by partitioning the golden codes into K subcodes, one for each message. The proposed scheme is shown to have the property that for any side information configuration, the minimum determinant of the code increases exponentially with the amount of information contained in the side information.