Gilbert-Varshamov-like lower bounds for deletion-correcting codes.
Frederic SalaRyan GabrysLara DolecekPublished in: ITW (2014)
Keyphrases
- lower bound
- upper bound
- error correction
- branch and bound algorithm
- branch and bound
- objective function
- lower bounding
- channel coding
- worst case
- lower and upper bounds
- upper and lower bounds
- vc dimension
- optimal solution
- sample complexity
- linear programming relaxation
- np hard
- genetic algorithm
- similarity search
- average case
- error correcting
- error correcting codes
- error control
- randomly generated problems
- insertions and deletions