An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes
Daniel CullinaNegar KiyavashPublished in: CoRR (2013)
Keyphrases
- upper bound
- lower bound
- lower and upper bounds
- worst case
- branch and bound algorithm
- minimum distance
- upper and lower bounds
- error correction
- error correcting codes
- branch and bound
- databases
- machine learning
- real time
- special case
- hamming distance
- significant improvement
- information retrieval
- single item
- error probability