Vladimir Levenshtein

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Vladimir Levenshtein
BornVladimir Iosifovich Levenshtein
(1935-05-20)20 May 1935
Moscow, USSR
Died6 September 2017(2017-09-06) (aged 82)
ResidenceMoscow, Russia
NationalityRussian
CitizenshipRussia
Alma materMoscow State University
Known forLevenshtein distance
Levenshtein automaton
Levenshtein coding
AwardsIEEE Richard W. Hamming Medal (2006)
Scientific career
FieldsMathematics

Vladimir Iosifovich Levenshtein (Russian: Влади́мир Ио́сифович Левенште́йн, IPA: [vlɐˈdʲimʲɪr ɪˈosʲɪfəvʲɪtɕ lʲɪvʲɪnˈʂtʲejn] (About this soundlisten); March 20, 1935 – September 6, 2017) was a Russian scientist who did research in information theory, error-correcting codes, and combinatorial design.[1] Among other contributions, he is known for the Levenshtein distance and a Levenshtein algorithm, which he developed in 1965.

He graduated from the Department of Mathematics and Mechanics of Moscow State University in 1958 and worked at the Keldysh Institute of Applied Mathematics in Moscow ever since. He was a fellow of the IEEE Information Theory Society.

He received the IEEE Richard W. Hamming Medal in 2006, for "contributions to the theory of error-correcting codes and information theory, including the Levenshtein distance".[2]

Publications[edit]

  • Levenshtein, V. I. (1965), "Binary codes capable of correcting deletions, insertions, and reversals.", Doklady Akademii Nauk SSSR, 163 (4): 845–848
  • Delsarte, P.; Levenshtein, V. I. (1998), "Association schemes and coding theory", IEEE Transactions on Information Theory, 44 (6): 2477–2504, doi:10.1109/18.720545

See also[edit]

References[edit]

  1. ^ "Код без ошибок". nplus1.ru (in Russian). Retrieved 2017-10-21.
  2. ^ "IEEE Richard W. Hamming Medal Recipients" (PDF). IEEE. Retrieved May 29, 2011.

External links[edit]