|Born||Vladimir Iosifovich Levenshtein|
20 May 1935
|Died||6 September 2017(aged 82)|
|Alma mater||Moscow State University|
|Known for||Levenshtein distance|
|Awards||IEEE Richard W. Hamming Medal (2006)|
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. 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.
- 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
- 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 biographical article about a Russian scientist is a stub. You can help Wikipedia by expanding it.|