Vladimir I. Levenshtein

37 papers B 5Journal 28Unranked 3
YearRankTypeTitle / Venue / Authors
2011 J jnl
Error Graphs and the Reconstruction of Elements in Groups
CoRR
Vladimir I. Levenshtein, Johannes Siemons
2009 J jnl
Error graphs and the reconstruction of elements in groups.
J. Comb. Theory A
Vladimir I. Levenshtein, Johannes Siemons
2008 J jnl
A conjecture on the reconstruction of graphs from metric balls of their vertices.
Discret. Math.
Vladimir I. Levenshtein
2008 J jnl
Reconstruction of a graph from 2-vicinities of its vertices.
Discret. Appl. Math.
Vladimir I. Levenshtein, Elena V. Konstantinova, Eugene Konstantinov, Sergey G. Molodtsov
2007 J jnl
Conflict-avoiding codes and cyclic triple systems.
Probl. Inf. Transm.
Vladimir I. Levenshtein
2006 — conf
06201 Abstracts Collection -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery.
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery
Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein
2006 — conf
06201 Executive Summary -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery.
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery
Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein
2006 B conf
A bound for codes with given minimum and maximum distances.
ISIT
Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein
2006 — ed.
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05. - 19.05.2006
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery
Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein
2006 B conf
On Minimum Girth of Graphs Reconstructible from Metric Balls of Their Vertices.
ISIT
Vladimir I. Levenshtein
2005 J jnl
Error-correction capability of binary linear codes.
IEEE Trans. Inf. Theory
Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein
2005 B conf
Optimal conflict-avoiding codes for three active users.
ISIT
Vladimir I. Levenshtein, Vladimir D. Tonchev
2005 J jnl
Reconstruction of a graph from 2-vicinities of its vertices
Electron. Notes Discret. Math.
Vladimir I. Levenshtein, Elena V. Konstantinova, Eugene Konstantinov, Sergey G. Molodtsov
2004 B conf
A system of polynomials for the complex hamming spaces.
ISIT
Vladimir I. Levenshtein
2004 J jnl
The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction.
IEEE Trans. Inf. Theory
Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein
2003 B conf
A coset weight count that proves that the simplex codes are not optimal for error correction.
ITW
Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein
2003 J jnl
A universal bound for a covering in regular posets and its application to pool testing.
Discret. Math.
Vladimir I. Levenshtein
2003 J jnl
Application of Cover-free Codes and Combinatorial Designs to Two-stage Testing.
Discret. Appl. Math.
Toby Berger, Vladimir I. Levenshtein
2003 J jnl
Hypercubic 4 and 5-Designs from Double-Error-Correcting BCH Codes.
Des. Codes Cryptogr.
Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein
2002 J jnl
Asymptotic efficiency of two-stage disjunctive testing.
IEEE Trans. Inf. Theory
Toby Berger, Vladimir I. Levenshtein
2001 J jnl
Application of cover-free codes and combinatorial designs to two-stage testing.
Electron. Notes Discret. Math.
Toby Berger, Vladimir I. Levenshtein
2001 J jnl
Efficient Reconstruction of Sequences from Their Subsequences or Supersequences.
J. Comb. Theory A
Vladimir I. Levenshtein
2001 J jnl
Efficient reconstruction of sequences.
IEEE Trans. Inf. Theory
Vladimir I. Levenshtein
1999 J jnl
Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications.
Discret. Math.
Vladimir I. Levenshtein
1999 J jnl
New Lower Bounds on Aperiodic Crosscorrelation of Binary Codes.
IEEE Trans. Inf. Theory
Vladimir I. Levenshtein
1998 J jnl
Association Schemes and Coding Theory.
IEEE Trans. Inf. Theory
Philippe Delsarte, Vladimir I. Levenshtein
1998 J jnl
On designs in compact metric spaces and a universal bound on their size.
Discret. Math.
Vladimir I. Levenshtein
1997 J jnl
On the information function of an error-correcting code.
IEEE Trans. Inf. Theory
Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein
1997 J jnl
Split Orthogonal Arrays and Maximum Independent Resilient Systems of Functions.
Des. Codes Cryptogr.
Vladimir I. Levenshtein
1995 J jnl
Bounds on the minimum support weights.
IEEE Trans. Inf. Theory
Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein, Øyvind Ytrehus
1995 J jnl
Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces.
IEEE Trans. Inf. Theory
Vladimir I. Levenshtein
1995 J jnl
On Upper Bounds for Code Distance and Covering Radius of Designs in Polynomial Metric Spaces.
J. Comb. Theory A
G. Fazekas, Vladimir I. Levenshtein
1994 J jnl
Superimposed codes in the Hamming space.
IEEE Trans. Inf. Theory
Thomas H. E. Ericson, Vladimir I. Levenshtein
1993 — conf
Bounds for Codes as Solutions of Extremum Problems for Systems of Orthogonal Polynominals.
AAECC
Vladimir I. Levenshtein
1993 J jnl
Packing and Decomposition Problems for Polynomial Association Schemes.
Eur. J. Comb.
Vladimir I. Levenshtein
1993 J jnl
Perfect (d, k)-codes capable of correcting single peak-shifts.
IEEE Trans. Inf. Theory
Vladimir I. Levenshtein, A. J. Han Vinck
1975 J jnl
On the Minimal Redundancy of Binary Error-Correcting Codes
Inf. Control.
Vladimir I. Levenshtein