Abstract
Recent developments in network information theory, such as interference alignment and compute-and-forward, have highlighted connections to the branch of mathematics known as Diophantine approximation. At a high level, Diophantine approximation is concerned with how well the reals can be approximated by rationals. This paper surveys some classical and modern Diophantine results and demonstrates their applications in establishing degrees-of-freedom and capacity bounds.
Original language | English |
---|---|
Title of host publication | 54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 990-996 |
Number of pages | 7 |
ISBN (Electronic) | 9781509045495 |
DOIs | |
State | Published - 10 Feb 2017 |
Externally published | Yes |
Event | 54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016 - Monticello, United States Duration: 27 Sep 2016 → 30 Sep 2016 |
Publication series
Name | 54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016 |
---|
Conference
Conference | 54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016 |
---|---|
Country/Territory | United States |
City | Monticello |
Period | 27/09/16 → 30/09/16 |
Bibliographical note
Publisher Copyright:© 2016 IEEE.