Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Vladimir I. Levenshtein
2010 – today
- 2011
[i1]Vladimir I. Levenshtein, Johannes Siemons: Error Graphs and the Reconstruction of Elements in Groups. CoRR abs/1110.5045 (2011)
2000 – 2009
- 2009
- [j26]Vladimir I. Levenshtein, Johannes Siemons: Error graphs and the reconstruction of elements in groups. J. Comb. Theory, Ser. A 116(4): 795-815 (2009)
- 2008
- [j25]Vladimir I. Levenshtein, Elena V. Konstantinova, Eugene Konstantinov, Sergey Molodtsov: Reconstruction of a graph from 2-vicinities of its vertices. Discrete Applied Mathematics 156(9): 1399-1406 (2008)
- [j24]Vladimir I. Levenshtein: A conjecture on the reconstruction of graphs from metric balls of their vertices. Discrete Mathematics 308(5-6): 993-998 (2008)
- 2006
- [c3]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
- [c2]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
- [e1]Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein (Eds.): 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
- 2005
- [j23]Vladimir I. Levenshtein, Elena V. Konstantinova, Eugene Konstantinov, Sergey Molodtsov: Reconstruction of a graph from 2-vicinities of its vertices, . Electronic Notes in Discrete Mathematics 21: 347-351 (2005)
- [j22]Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein: Error-correction capability of binary linear codes. IEEE Transactions on Information Theory 51(4): 1408-1423 (2005)
- 2004
- [j21]Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein: The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction. IEEE Transactions on Information Theory 50(11): 2818-2823 (2004)
- 2003
- [j20]Toby Berger, Vladimir I. Levenshtein: Application of Cover-free Codes and Combinatorial Designs to Two-stage Testing. Discrete Applied Mathematics 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 Cryptography 28(3): 265-282 (2003)
- [j18]Vladimir I. Levenshtein: A universal bound for a covering in regular posets and its application to pool testing. Discrete Mathematics 266(1-3): 293-309 (2003)
- 2002
- [j17]Toby Berger, Vladimir I. Levenshtein: Asymptotic efficiency of two-stage disjunctive testing. IEEE Transactions on Information 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. Electronic Notes in Discrete Mathematics 6: 518-527 (2001)
- [j15]Vladimir I. Levenshtein: Efficient Reconstruction of Sequences from Their Subsequences or Supersequences. J. Comb. Theory, Ser. A 93(2): 310-332 (2001)
- [j14]Vladimir I. Levenshtein: Efficient reconstruction of sequences. IEEE Transactions on Information 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. Discrete Mathematics 197-198: 515-536 (1999)
- [j12]Vladimir I. Levenshtein: New Lower Bounds on Aperiodic Crosscorrelation of Binary Codes. IEEE Transactions on Information Theory 45(1): 284-288 (1999)
- 1998
- [j11]Vladimir I. Levenshtein: On designs in compact metric spaces and a universal bound on their size. Discrete Mathematics 192(1-3): 251-271 (1998)
- [j10]Philippe Delsarte, Vladimir I. Levenshtein: Association Schemes and Coding Theory. IEEE Transactions on Information Theory 44(6): 2477-2504 (1998)
- 1997
- [j9]Vladimir I. Levenshtein: Split Orthogonal Arrays and Maximum Independent Resilient Systems of Functions. Des. Codes Cryptography 12(2): 131-160 (1997)
- [j8]Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein: On the information function of an error-correcting code. IEEE Transactions on Information 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, Ser. A 70(2): 267-288 (1995)
- [j6]Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein, Øyvind Ytrehus: Bounds on the minimum support weights. IEEE Transactions on Information Theory 41(2): 432-440 (1995)
- [j5]Vladimir I. Levenshtein: Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces. IEEE Transactions on Information Theory 41(5): 1303-1321 (1995)
- 1994
- [j4]Thomas H. E. Ericson, Vladimir I. Levenshtein: Superimposed codes in the Hamming space. IEEE Transactions on Information 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 Transactions on Information 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. Information and Control 28(4): 268-291 (1975)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:00 CEST by the dblp team