| 2008 |
|---|
| 29 | EE | 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) |
| 28 | EE | 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 |
|---|
| 27 | | Rudolf Ahlswede,
Alberto Apostolico,
Vladimir I. Levenshtein:
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05. - 19.05.2006
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 |
| 26 | EE | 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 |
| 25 | EE | 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 |
| 2005 |
|---|
| 24 | EE | 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) |
| 23 | EE | 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 |
|---|
| 22 | | 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 |
|---|
| 21 | EE | 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) |
| 20 | EE | 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) |
| 19 | EE | 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 |
|---|
| 18 | | Toby Berger,
Vladimir I. Levenshtein:
Asymptotic efficiency of two-stage disjunctive testing.
IEEE Transactions on Information Theory 48(7): 1741-1749 (2002) |
| 2001 |
|---|
| 17 | EE | 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) |
| 16 | | Vladimir I. Levenshtein:
Efficient reconstruction of sequences.
IEEE Transactions on Information Theory 47(1): 2-22 (2001) |
| 15 | EE | Vladimir I. Levenshtein:
Efficient Reconstruction of Sequences from Their Subsequences or Supersequences.
J. Comb. Theory, Ser. A 93(2): 310-332 (2001) |
| 1999 |
|---|
| 14 | EE | 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) |
| 13 | | Vladimir I. Levenshtein:
New Lower Bounds on Aperiodic Crosscorrelation of Binary Codes.
IEEE Transactions on Information Theory 45(1): 284-288 (1999) |
| 1998 |
|---|
| 12 | EE | Vladimir I. Levenshtein:
On designs in compact metric spaces and a universal bound on their size.
Discrete Mathematics 192(1-3): 251-271 (1998) |
| 11 | | Philippe Delsarte,
Vladimir I. Levenshtein:
Association Schemes and Coding Theory.
IEEE Transactions on Information Theory 44(6): 2477-2504 (1998) |
| 1997 |
|---|
| 10 | | Vladimir I. Levenshtein:
Split Orthogonal Arrays and Maximum Independent Resilient Systems of Functions.
Des. Codes Cryptography 12(2): 131-160 (1997) |
| 9 | | 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 |
|---|
| 8 | | 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) |
| 7 | | 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) |
| 6 | | 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) |
| 1994 |
|---|
| 5 | | Thomas H. E. Ericson,
Vladimir I. Levenshtein:
Superimposed codes in the Hamming space.
IEEE Transactions on Information Theory 40(6): 1882-1893 (1994) |
| 1993 |
|---|
| 4 | | Vladimir I. Levenshtein:
Bounds for Codes as Solutions of Extremum Problems for Systems of Orthogonal Polynominals.
AAECC 1993: 25-42 |
| 3 | EE | Vladimir I. Levenshtein:
Packing and Decomposition Problems for Polynomial Association Schemes.
Eur. J. Comb. 14(5): 461-477 (1993) |
| 2 | | 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- (1993) |
| 1975 |
|---|
| 1 | | Vladimir I. Levenshtein:
On the Minimal Redundancy of Binary Error-Correcting Codes
Information and Control 28(4): 268-291 (1975) |
