TY - GEN
T1 - Diophantine approximation for network information theory
T2 - 54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016
AU - Nazer, Bobak
AU - Ordentlich, Or
N1 - Publisher Copyright: © 2016 IEEE.
PY - 2017/2/10
Y1 - 2017/2/10
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/85015221944
U2 - 10.1109/ALLERTON.2016.7852342
DO - 10.1109/ALLERTON.2016.7852342
M3 - Conference contribution
T3 - 54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016
SP - 990
EP - 996
BT - 54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 27 September 2016 through 30 September 2016
ER -