Lattices from Codes for Harnessing Interference: An Overview and Generalizations

2014/06/12 by Yu-Chih Huang, Huang, Yu-Chih, Krishna R. Narayanan +1 · 2 citations
Computer Science · Engineering · #Coding theory and cryptography #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1406.3368

openalex publication_date 2014/06/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, using compute-and-forward as an example, we provide an overview of constructions of lattices from codes that possess the right algebraic structures for harnessing interference. This includes Construction A, Construction D, and Construction π_A (previously called product construction) recently proposed by the authors. We then discuss two generalizations where the first one is a general construction of lattices named Construction π_D subsuming the above three constructions as special cases and the second one is to go beyond principal ideal domains and build lattices over algebraic integers.

Cited by

• Construction π_A and π_D Lattices: Construction, Goodness, and Decoding Algorithms
• Robust Successive Compute-and-Forward over Multi-User Multi-Relay Networks

Related

• Construction π_A and π_D Lattices: Construction, Goodness, and Decoding Algorithms
• Connections Between Construction D and Related Constructions of Lattices
• Lattices from codes over ℤ_q: Generalization of Constructions D, D' and D
• Lattices of type A_n, D_n, E_n and codes
• Multistage Compute-and-Forward with Multilevel Lattice Codes Based on Product Constructions