Levenshtein proposed a class of single insertion/deletion correcting codes, based on the number-theoretic construction due to Varshamov and Tenengolt’s. We present several interesting results on the binary structure of these codes, and their relation to constrained codes with nulls in the power spectral density function. One surprising result is that the higher order spectral null codes of Immi...

Difference systems of sets were introduced by Levenshtein in connection with code synchronization. The paper discusses some constructions of difference systems of sets obtained from cyclic difference sets and finite geometry.

Japanese medical device adverse events terminology, published by the Japan Federation of Medical Devices Associations (JFMDA terminology), contains entries for 89 terminology items, with each created independently. It is necessary to establish and verify consistency these map them efficiently accurately. Therefore, developing an automatic synonym detection tool important concern. Such tools edi...

Codebooks with small maximal cross-correlation amplitudes have important applications in code division multiple access (CDMA) communication, coding theory and compressed sensing. In this letter, we design a new codebook based on construction of Ramanujan graphs over finite abelian groups. We prove that the length K=q+1 size N=q2+2q+2 is asymptotically optimal nearly achieving Levenshtein bound ...

Bu çalışmanın temel amacı Oğuz grubu yazı dillerinin birbirlerine karşı fonetik uzaklıklarını tespit etmektir. Çalışmada uzaklıkların tespiti için bilgisayarlı dil bilim alanında sıkça kullanılan niceliksel ölçüm tekniklerinden Levenshtein uzaklık algoritması kullanılmıştır. bağlamda, Türkiye’deki lehçe araştırmalarında kullanılabilecek bir yöntemi tanıtarak ilgili alanda yeni değerlendirmeleri...