1. On the computation of Levenshtein's distances;Calabi,1967
2. A family of codes for the correction of substitution and synchronization erros;Calabi;IEEE Trans.,1969
3. Generalizations of tests for certain properties of variable length codes;Hartnett;Inform. Control,1968
4. Binary codes for the correction of deletions, insertions and substitutions of symbols;Levenshtein;Doklady Akad. Nauk SSSR,1965
5. Codes with synchronization ability;Scholtz;IEEE Trans.,1966