Achieving uniform side information gain with multilevel lattice codes over the ring of integers
Juliana G. F. Souza, Sueli I. R. Costa

TL;DR
This paper introduces a novel lattice coding scheme for index coding problems, leveraging Construction π_A lattices over integers to optimize broadcast efficiency and achieve uniform side information gain.
Contribution
It proposes CRT lattice index coding using Construction π_A over integers, providing bounds and conditions for uniform side information gain, with theoretical analysis and design examples.
Findings
Derived an upper bound for side information gain.
Established conditions for uniform gain.
Demonstrated efficiency through theoretical analysis and examples.
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 lattices to index coding. We introduce a coding scheme, named \textit{CRT lattice index coding}, using Construction 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Error Correcting Code Techniques · Advanced Wireless Communication Techniques
