Polynomially Solvable Instances of the Shortest and Closest Vector Problems With Applications to Compute-and-Forward

DOI10.1109/TIT.2017.2759281zbMath1390.94638arXiv1512.06667OpenAlexW3102148835MaRDI QIDQ4566607

Saeid Sahraei, Michael C. Gastpar

Publication date: 27 June 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.06667

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Related Items (1)

An Approximation of Theta Functions with Applications to Communications

This page was built for publication: Polynomially Solvable Instances of the Shortest and Closest Vector Problems With Applications to Compute-and-Forward