Vladimir I. Levenshtein

Publication Activity (10 Years)

Years Active: 1975-2011
Publications (10 Years): 0

Publications

Vladimir I. Levenshtein, Johannes Siemons
Error Graphs and the Reconstruction of Elements in Groups CoRR (2011)
Vladimir I. Levenshtein, Johannes Siemons
Error graphs and the reconstruction of elements in groups. J. Comb. Theory, Ser. A 116 (4) (2009)
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) (2008)
Vladimir I. Levenshtein
A conjecture on the reconstruction of graphs from metric balls of their vertices. Discret. Math. 308 (5-6) (2008)
Vladimir I. Levenshtein
Conflict-avoiding codes and cyclic triple systems. Probl. Inf. Transm. 43 (3) (2007)
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)
Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein
A bound for codes with given minimum and maximum distances. ISIT (2006)
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)
Vladimir I. Levenshtein
On Minimum Girth of Graphs Reconstructible from Metric Balls of Their Vertices. ISIT (2006)
Vladimir I. Levenshtein, Elena V. Konstantinova, Eugene Konstantinov, Sergey G. Molodtsov
. Electron. Notes Discret. Math. 21 (2005)
Vladimir I. Levenshtein, Vladimir D. Tonchev
Optimal conflict-avoiding codes for three active users. ISIT (2005)
Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein
Error-correction capability of binary linear codes. IEEE Trans. Inf. Theory 51 (4) (2005)
Vladimir I. Levenshtein
A system of polynomials for the complex hamming spaces. ISIT (2004)
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) (2004)
Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein
Hypercubic 4 and 5-Designs from Double-Error-Correcting BCH Codes. Des. Codes Cryptogr. 28 (3) (2003)
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)
Toby Berger, Vladimir I. Levenshtein
Application of Cover-free Codes and Combinatorial Designs to Two-stage Testing. Discret. Appl. Math. 128 (1) (2003)
Vladimir I. Levenshtein
A universal bound for a covering in regular posets and its application to pool testing. Discret. Math. 266 (1-3) (2003)
Toby Berger, Vladimir I. Levenshtein
Asymptotic efficiency of two-stage disjunctive testing. IEEE Trans. Inf. Theory 48 (7) (2002)
Vladimir I. Levenshtein
Efficient Reconstruction of Sequences from Their Subsequences or Supersequences. J. Comb. Theory, Ser. A 93 (2) (2001)
Vladimir I. Levenshtein
Efficient reconstruction of sequences. IEEE Trans. Inf. Theory 47 (1) (2001)
Toby Berger, Vladimir I. Levenshtein
Application of cover-free codes and combinatorial designs to two-stage testing. Electron. Notes Discret. Math. 6 (2001)
Vladimir I. Levenshtein
New Lower Bounds on Aperiodic Crosscorrelation of Binary Codes. IEEE Trans. Inf. Theory 45 (1) (1999)
Vladimir I. Levenshtein
Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications. Discret. Math. (1999)
Vladimir I. Levenshtein
On designs in compact metric spaces and a universal bound on their size. Discret. Math. 192 (1-3) (1998)
Philippe Delsarte, Vladimir I. Levenshtein
Association Schemes and Coding Theory. IEEE Trans. Inf. Theory 44 (6) (1998)
Vladimir I. Levenshtein
Split Orthogonal Arrays and Maximum Independent Resilient Systems of Functions. Des. Codes Cryptogr. 12 (2) (1997)
Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein
On the information function of an error-correcting code. IEEE Trans. Inf. Theory 43 (2) (1997)
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) (1995)
Vladimir I. Levenshtein
Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces. IEEE Trans. Inf. Theory 41 (5) (1995)
Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein, Øyvind Ytrehus
Bounds on the minimum support weights. IEEE Trans. Inf. Theory 41 (2) (1995)
Thomas H. E. Ericson, Vladimir I. Levenshtein
Superimposed codes in the Hamming space. IEEE Trans. Inf. Theory 40 (6) (1994)
Vladimir I. Levenshtein, A. J. Han Vinck
Perfect (d, k)-codes capable of correcting single peak-shifts. IEEE Trans. Inf. Theory 39 (2) (1993)
Vladimir I. Levenshtein
Packing and Decomposition Problems for Polynomial Association Schemes. Eur. J. Comb. 14 (5) (1993)
Vladimir I. Levenshtein
Bounds for Codes as Solutions of Extremum Problems for Systems of Orthogonal Polynominals. AAECC (1993)
Vladimir I. Levenshtein
On the Minimal Redundancy of Binary Error-Correcting Codes Inf. Control. 28 (4) (1975)