Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound.
Daniel HeinleinSascha KurzPublished in: CoRR (2017)
Keyphrases
- lower bound
- upper bound
- worst case
- lower and upper bounds
- constant factor
- upper and lower bounds
- branch and bound
- np hard
- arbitrarily close
- branch and bound algorithm
- objective function
- error correction
- optimal solution
- finite sample
- lower bounding
- randomized algorithms
- vc dimension
- large deviations
- closed form expressions
- sample size
- sample complexity
- average case
- asymptotically optimal
- linear programming relaxation
- approximation algorithms
- loss bounds
- laplace transform