2016/01/25 by Prasad Krishnan, Krishnan, Prasad, V. Lalitha +1
Computer Science · Engineering · #Advanced MIMO Systems Optimization #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.1601.06689
openalex publication_date 2016/01/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
An index coding problem with n messages has symmetric rate R if all n messages can be conveyed at rate R. In a recent work, a class of index coding problems for which symmetric rate (1)/(3) is achievable was characterised using special properties of the side-information available at the receivers. In this paper, we show a larger class of index coding problems (which includes the previous class of problems) for which symmetric rate (1)/(3) is achievable. In the process, we also obtain a stricter necessary condition for rate (1)/(3) feasibility than what is known in literature.