New lower bounds for constant dimension codes.
Natalia SilbersteinAnna-Lena TrautmannPublished in: ISIT (2013)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- np hard
- constant factor
- objective function
- lower and upper bounds
- optimal solution
- branch and bound
- upper and lower bounds
- worst case
- error correction
- linear programming relaxation
- quadratic assignment problem
- lower bounding
- sample complexity
- temporal dimension
- error correcting
- error correcting codes
- error control