Vladimir I. Levenshtein
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
5
Venues
2
Active years
2003–2006
Best venue rank
B
Where they publish
Papers
5 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2006 | ISIT | A bound for codes with given minimum and maximum distances. | Tor Helleseth, Torleiv Klve, Vladimir I. Levenshtein |
| 2006 | ISIT | On Minimum Girth of Graphs Reconstructible from Metric Balls of Their Vertices. | Vladimir I. Levenshtein |
| 2005 | ISIT | Optimal conflict-avoiding codes for three active users. | Vladimir I. Levenshtein, Vladimir D. Tonchev |
| 2004 | ISIT | A system of polynomials for the complex hamming spaces. | Vladimir I. Levenshtein |
| 2003 | ITW | A coset weight count that proves that the simplex codes are not optimal for error correction. | Tor Helleseth, Torleiv Klve, Vladimir I. Levenshtein |