Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices.
Léo DucasCécile PierrotPublished in: Des. Codes Cryptogr. (2019)
Keyphrases
- distance transform
- worst case
- distance metric
- upper bound
- distance measure
- bounded treewidth
- special case
- lower bound
- asymptotically optimal
- search algorithm
- approximation algorithms
- error bounds
- distance function
- minimum distance
- continuous functions
- complexity bounds
- real valued functions
- finite number
- np complete
- discrete space
- decoding algorithm
- bayesian networks
- discrete geometry
- discrete version
- truth table