2000 character limit reached
A Linearithmic Time Algorithm for a Shortest Vector Problem in Compute-and-Forward Design
Published 30 Jan 2016 in cs.IT and math.IT | (1602.00169v1)
Abstract: We propose an algorithm with expected complexity of $\bigO(n\log n)$ arithmetic operations to solve a special shortest vector problem arising in computer-and-forward design, where $n$ is the dimension of the channel vector. This algorithm is more efficient than the best known algorithms with proved complexity.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.