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 pi(A) (previously called product construction) recently proposed by the authors. While most of the results in this paper have been available in the literature, we discuss two generalizations where the first one is a general construction of lattices named Construction pi(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.
| Original language | English |
|---|---|
| Title of host publication | 2014 IEEE INFORMATION THEORY WORKSHOP (ITW) |
| Publisher | IEEE |
| Pages | 10-14 |
| Number of pages | 5 |
| State | Published - 2014 |
| Event | IEEE Information Theory Workshop (ITW) - Hobart, Australia Duration: 2 Nov 2014 → 5 Nov 2014 |
Publication series
| Name | Information Theory Workshop |
|---|---|
| Publisher | IEEE |
| ISSN (Print) | 2475-420X |
Conference
| Conference | IEEE Information Theory Workshop (ITW) |
|---|---|
| Country | Australia |
| City | Hobart |
| Period | 2/11/14 → 5/11/14 |
Keywords
- PACKINGS
Cite this
Huang, Y-C., & Narayanan, K. R. (2014). Lattices from Codes for Harnessing Interference: An Overview and Generalizations. In 2014 IEEE INFORMATION THEORY WORKSHOP (ITW) (pp. 10-14). (Information Theory Workshop). IEEE.