Asymptotic Bounds for the Sizes of Constant Dimension Codes and an Improved Lower Bound.
Daniel HeinleinSascha KurzPublished in: ICMCTA (2017)
Keyphrases
- lower bound
- upper bound
- worst case
- lower and upper bounds
- constant factor
- upper and lower bounds
- branch and bound algorithm
- arbitrarily close
- branch and bound
- np hard
- optimal cost
- optimal solution
- average case
- rates of convergence
- objective function
- vc dimension
- lower bounding
- large deviations
- error correction
- finite sample
- randomized algorithms
- asymptotically optimal
- expected values
- sample complexity
- lagrangian relaxation
- sample size
- linear programming relaxation
- closed form expressions