Generalization and Improvement of the Levenshtein Lower Bound for Aperiodic Correlation.
Fabien ArleryUyHour TanOlivier RabastePublished in: IEEE Trans. Inf. Theory (2019)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- objective function
- branch and bound
- lower and upper bounds
- upper and lower bounds
- lower bounding
- worst case
- np hard
- optimal solution
- sufficiently accurate
- scheduling problem
- data sets
- machine learning
- high correlation
- linear programming
- linear programming relaxation
- sample complexity
- highly correlated
- neural network