Lattice reduction does not change the solution vector for many algorithms in vector perturbation precoding due to a unique lattice structure, and LLL-aided nearest plane methods do not beat conventional THP under mutual information.
Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Restricted Syndrome Decoding reduces to Regular Syndrome Decoding and Closest Vector Problem via structured low-norm vectors in constructed codes, broadening attacks on the CROSS signature scheme.
citing papers explorer
-
Is Lattice Reduction Necessary for Vector Perturbation Precoding?
Lattice reduction does not change the solution vector for many algorithms in vector perturbation precoding due to a unique lattice structure, and LLL-aided nearest plane methods do not beat conventional THP under mutual information.
-
Cross-Paradigm Models of Restricted Syndrome Decoding with Application to CROSS
Restricted Syndrome Decoding reduces to Regular Syndrome Decoding and Closest Vector Problem via structured low-norm vectors in constructed codes, broadening attacks on the CROSS signature scheme.