An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes.
Daniel CullinaNegar KiyavashPublished in: IEEE Trans. Inf. Theory (2014)
Keyphrases
- upper bound
- lower bound
- worst case
- branch and bound algorithm
- upper and lower bounds
- error correction
- real time
- lower and upper bounds
- generalization error
- edit distance
- branch and bound
- pattern recognition
- information retrieval
- dynamic programming
- significant improvement
- multi agent
- approximation algorithms
- bayesian networks
- genetic algorithm
- hamming distance
- data mining
- database
- constant factor
- error probability