Vladimir Levenshtein | |
---|---|
Born | Vladimir Iosifovich Levenshtein 20 May 1935 |
Died | 6 September 2017 | (aged 82)
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 |
Institutions | Keldysh Institute of Applied Mathematics |
Vladimir Iosifovich Levenshtein (Russian: Влади́мир Ио́сифович Левенште́йн, IPA: [vlɐˈdʲimʲɪr ɨˈosʲɪfəvʲɪtɕ lʲɪvʲɪnˈʂtʲejn] ; 20 May 1935 – 6 September 2017) was a Russian and Soviet 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]