Global ETD Search

A constructive lower bound for cardinality of codebooks capable of correcting multiple deletion and insertions

Khajouei, FarzanehUniversity of Illinois at Urbana-Champaign2012

… construction of the largest codebook capable of correcting multiple number of deletions and insertions is an open problem in coding theory. The efforts in the design of these codes mostly concentrate on finding the largest codebook size for a fixed number of deletions and a codeword length. In …

uiuc Repository record for A constructive lower bound for cardinality of codebooks capable of correcting multiple deletion and insertions (opens in a new tab)