Abstract | ||
---|---|---|
A greedy selection based approach GfcLLL for fixed-complexity LLL reductions (FCLLL) is proposed. Two greedy selection strategies are presented. Simulations show that each of the two strategies gives Babai points with lower bit error rate in a more or less equal or much shorter CPU time than existing FCLLL algorithms. |
Year | Venue | DocType |
---|---|---|
2016 | CoRR | Journal |
Volume | Citations | PageRank |
abs/1607.01064 | 1 | 0.37 |
References | Authors | |
9 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
jinming wen | 1 | 103 | 14.52 |
Xiao-Wen Chang | 2 | 208 | 24.85 |