default search action
Vladimir I. Levenshtein
Person information
- unicode name: Влади́мир Ио́сифович Левенште́йн
- award (2006): IEEE Richard W. Hamming Medal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [i3]Vladimir I. Levenshtein, Johannes Siemons:
Error Graphs and the Reconstruction of Elements in Groups. CoRR abs/1110.5045 (2011)
2000 – 2009
- 2009
- [j27]Vladimir I. Levenshtein, Johannes Siemons:
Error graphs and the reconstruction of elements in groups. J. Comb. Theory A 116(4): 795-815 (2009) - 2008
- [j26]Vladimir I. Levenshtein, Elena V. Konstantinova
, Eugene Konstantinov, Sergey G. Molodtsov:
Reconstruction of a graph from 2-vicinities of its vertices. Discret. Appl. Math. 156(9): 1399-1406 (2008) - [j25]Vladimir I. Levenshtein:
A conjecture on the reconstruction of graphs from metric balls of their vertices. Discret. Math. 308(5-6): 993-998 (2008) - 2007
- [j24]Vladimir I. Levenshtein:
Conflict-avoiding codes and cyclic triple systems. Probl. Inf. Transm. 43(3): 199-212 (2007) - 2006
- [c6]Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein:
A bound for codes with given minimum and maximum distances. ISIT 2006: 292-296 - [c5]Vladimir I. Levenshtein:
On Minimum Girth of Graphs Reconstructible from Metric Balls of Their Vertices. ISIT 2006: 2488-2490 - [e1]Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein:
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05. - 19.05.2006. Dagstuhl Seminar Proceedings 06201, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [i2]Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein:
06201 Executive Summary -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 2006 - [i1]Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein:
06201 Abstracts Collection -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 2006 - 2005
- [j23]Vladimir I. Levenshtein, Elena V. Konstantinova
Reconstruction of a graph from 2-vicinities of its vertices, . Electron. Notes Discret. Math. 21: 347-351 (2005) - [j22]Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein:
Error-correction capability of binary linear codes. IEEE Trans. Inf. Theory 51(4): 1408-1423 (2005) - [c4]Vladimir I. Levenshtein, Vladimir D. Tonchev:
Optimal conflict-avoiding codes for three active users. ISIT 2005: 535-537 - 2004
- [j21]Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein:
The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction. IEEE Trans. Inf. Theory 50(11): 2818-2823 (2004) - [c3]Vladimir I. Levenshtein:
A system of polynomials for the complex hamming spaces. ISIT 2004: 361 - 2003
- [j20]Toby Berger, Vladimir I. Levenshtein:
Application of Cover-free Codes and Combinatorial Designs to Two-stage Testing. Discret. Appl. Math. 128(1): 11-26 (2003) - [j19]Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein:
Hypercubic 4 and 5-Designs from Double-Error-Correcting BCH Codes. Des. Codes Cryptogr. 28(3): 265-282 (2003) - [j18]Vladimir I. Levenshtein:
A universal bound for a covering in regular posets and its application to pool testing. Discret. Math. 266(1-3): 293-309 (2003) - [c2]Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein:
A coset weight count that proves that the simplex codes are not optimal for error correction. ITW 2003: 234-237 - 2002
- [j17]Toby Berger, Vladimir I. Levenshtein:
Asymptotic efficiency of two-stage disjunctive testing. IEEE Trans. Inf. Theory 48(7): 1741-1749 (2002) - 2001
- [j16]Toby Berger, Vladimir I. Levenshtein:
Application of cover-free codes and combinatorial designs to two-stage testing. Electron. Notes Discret. Math. 6: 518-527 (2001) - [j15]Vladimir I. Levenshtein:
Efficient Reconstruction of Sequences from Their Subsequences or Supersequences. J. Comb. Theory A 93(2): 310-332 (2001) - [j14]Vladimir I. Levenshtein:
Efficient reconstruction of sequences. IEEE Trans. Inf. Theory 47(1): 2-22 (2001)
1990 – 1999
- 1999
- [j13]Vladimir I. Levenshtein:
Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications. Discret. Math. 197-198: 515-536 (1999) - [j12]Vladimir I. Levenshtein:
New Lower Bounds on Aperiodic Crosscorrelation of Binary Codes. IEEE Trans. Inf. Theory 45(1): 284-288 (1999) - 1998
- [j11]Vladimir I. Levenshtein:
On designs in compact metric spaces and a universal bound on their size. Discret. Math. 192(1-3): 251-271 (1998) - [j10]Philippe Delsarte, Vladimir I. Levenshtein:
Association Schemes and Coding Theory. IEEE Trans. Inf. Theory 44(6): 2477-2504 (1998) - 1997
- [j9]Vladimir I. Levenshtein:
Split Orthogonal Arrays and Maximum Independent Resilient Systems of Functions. Des. Codes Cryptogr. 12(2): 131-160 (1997) - [j8]Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein:
On the information function of an error-correcting code. IEEE Trans. Inf. Theory 43(2): 549-557 (1997) - 1995
- [j7]G. Fazekas, Vladimir I. Levenshtein:
On Upper Bounds for Code Distance and Covering Radius of Designs in Polynomial Metric Spaces. J. Comb. Theory A 70(2): 267-288 (1995) - [j6]Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein, Øyvind Ytrehus:
Bounds on the minimum support weights. IEEE Trans. Inf. Theory 41(2): 432-440 (1995) - [j5]Vladimir I. Levenshtein:
Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces. IEEE Trans. Inf. Theory 41(5): 1303-1321 (1995) - 1994
- [j4]Thomas H. E. Ericson, Vladimir I. Levenshtein:
Superimposed codes in the Hamming space. IEEE Trans. Inf. Theory 40(6): 1882-1893 (1994) - 1993
- [j3]Vladimir I. Levenshtein:
Packing and Decomposition Problems for Polynomial Association Schemes. Eur. J. Comb. 14(5): 461-477 (1993) - [j2]Vladimir I. Levenshtein, A. J. Han Vinck:
Perfect (d, k)-codes capable of correcting single peak-shifts. IEEE Trans. Inf. Theory 39(2): 656-662 (1993) - [c1]Vladimir I. Levenshtein:
Bounds for Codes as Solutions of Extremum Problems for Systems of Orthogonal Polynominals. AAECC 1993: 25-42
1970 – 1979
- 1975
- [j1]Vladimir I. Levenshtein:
On the Minimal Redundancy of Binary Error-Correcting Codes. Inf. Control. 28(4): 268-291 (1975)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: