An improvement to Levenshtein's upper bound on the cardinality of deletion correcting codes.
Daniel CullinaNegar KiyavashPublished in: ISIT (2013)
Keyphrases
- upper bound
- lower bound
- worst case
- data sets
- error correction
- edit distance
- error probability
- lower and upper bounds
- sample complexity
- branch and bound
- hidden markov models
- special case
- upper and lower bounds
- database
- pattern recognition
- optimal solution
- similarity measure
- decision trees
- artificial intelligence
- genetic algorithm
- databases
- real time