Achieving uniform side information gain with multilevel lattice codes over the ring of integers

2025/01/24 by Juliana G. F. Souza, Souza, Juliana G. F., Sueli I. R. Costa +1
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Coding theory and cryptography #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.2501.14921

openalex publication_date 2025/01/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Abstract

The index coding problem aims to optimise broadcast communication by taking advantage of receiver-side information to improve transmission efficiency. In this letter, we explore the application of Construction π_A lattices to index coding. We introduce a coding scheme, named CRT lattice index coding, using Construction π_A over ℤ to address the index coding problem. It is derived an upper bound for side information gain of a CRT lattice index code and conditions for the uniformity of this gain. The efficiency of this approach is shown through theoretical analysis and code design examples.

Related

• Lattice Index Codes from Algebraic Number Fields
• Lattice Codes Achieve the Capacity of Common Message Gaussian Broadcast Channels with Coded Side Information
• Optimal Index Codes via a Duality between Index Coding and Network\n Coding
• Construction π_A and π_D Lattices: Construction, Goodness, and Decoding Algorithms
• Index Coding and Network Coding via Rank Minimization