A Linearithmic Time Algorithm for a Shortest Vector Problem in Compute-and-Forward Design
Information Theory
2016-02-02 v1 math.IT
Abstract
We propose an algorithm with expected complexity of arithmetic operations to solve a special shortest vector problem arising in computer-and-forward design, where is the dimension of the channel vector. This algorithm is more efficient than the best known algorithms with proved complexity.
Cite
@article{arxiv.1602.00169,
title = {A Linearithmic Time Algorithm for a Shortest Vector Problem in Compute-and-Forward Design},
author = {Jinming Wen and Xiao-Wen Chang},
journal= {arXiv preprint arXiv:1602.00169},
year = {2016}
}
Comments
It has been submitted to ISIT 2016