A lower bound for ternary constant weight codes.
Mattias SvanströmPublished in: IEEE Trans. Inf. Theory (1997)
Keyphrases
- lower bound
- upper bound
- constant factor
- branch and bound algorithm
- lower and upper bounds
- worst case
- optimal solution
- branch and bound
- error correction
- np hard
- objective function
- upper and lower bounds
- arbitrarily close
- polynomial approximation
- weight assignment
- combinatorial optimization
- lower bounding
- online algorithms
- error correcting codes
- sample complexity
- sufficiently accurate
- approximation algorithms