Vladimir Levenshtein

Vladimir Levenshtein
Born Vladimir Iosifovich Levenshtein
(1935-05-20)20 May 1935
Moscow, USSR
Died 6 September 2017(2017-09-06) (aged 82)
Residence Moscow, Russia
Nationality Russian
Citizenship Russia
Alma mater Moscow State University
Known for Levenshtein distance
Levenshtein automaton
Levenshtein coding
Awards IEEE Richard W. Hamming Medal (2006)
Scientific career
Fields Mathematics

Vladimir Iosifovich Levenshtein (Russian: Влади́мир Ио́сифович Левенште́йн, IPA: [vlɐˈdʲimʲɪr ɪˈosʲɪfəvʲɪtɕ lʲɪvʲɪnˈʂtʲejn] ( listen); 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

  • 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

References

  1. ↑ "Код без ошибок". nplus1.ru (in Russian). Retrieved 2017-10-21.
  2. ↑ "IEEE Richard W. Hamming Medal Recipients" (PDF). IEEE. Retrieved May 29, 2011.
  • Levenstein's personal webpage - in Russian
  • March 2003 pictures of Levenshtein at a professional reception.
  • Another (better) picture from the same source
  • "2006 Richard W. Hamming Medal". IEEE. Archived from the original on 2007-09-19.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.