Vladimir I. Levenshtein - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

2009

Error graphs and the reconstruction of elements in groupsVladimir I. Levenshtein, Johannes Siemons. JCT, 116(4):795-815, 2009. [doi]

2008

Reconstruction of a graph from 2-vicinities of its verticesVladimir I. Levenshtein, Elena V. Konstantinova, Eugene Konstantinov, Sergey Molodtsov. DAM, 156(9):1399-1406, 2008. [doi]

A conjecture on the reconstruction of graphs from metric balls of their verticesVladimir I. Levenshtein. DM, 308(5-6):993-998, 2008. [doi]

2007

Conflict-avoiding codes and cyclic triple systemsVladimir I. Levenshtein. poit, 43(3):199-212, 2007. [doi]

2006

2005

Error-correction capability of binary linear codesTor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein. TIT, 51(4):1408-1423, 2005. [doi]

Reconstruction of a graph from 2-vicinities of its vertices:::, :::Vladimir I. Levenshtein, Elena V. Konstantinova, Eugene Konstantinov, Sergey Molodtsov. endm, 21:347-351, 2005. [doi]

Optimal conflict-avoiding codes for three active usersVladimir I. Levenshtein, Vladimir D. Tonchev. isit 2005: 535-537 [doi]

2004

The Simplex Codes and Other Even-Weight Binary Linear Codes for Error CorrectionTor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein. TIT, 50(11):2818-2823, 2004.

A system of polynomials for the complex hamming spacesVladimir I. Levenshtein. isit 2004: 361 [doi]

2003

2002

Asymptotic efficiency of two-stage disjunctive testingToby Berger, Vladimir I. Levenshtein. TIT, 48(7):1741-1749, 2002.

2001

Application of cover-free codes and combinatorial designs to two-stage testingToby Berger, Vladimir I. Levenshtein. endm, 6:518-527, 2001. [doi]

Efficient Reconstruction of Sequences from Their Subsequences or SupersequencesVladimir I. Levenshtein. JCT, 93(2):310-332, 2001. [doi]

Efficient reconstruction of sequencesVladimir I. Levenshtein. TIT, 47(1):2-22, 2001.

1999

Equivalence of Delsarte s bounds for codes and designs in symmetric association schemes, and some applicationsVladimir I. Levenshtein. DM, 197-198:515-536, 1999. [doi]

New Lower Bounds on Aperiodic Crosscorrelation of Binary CodesVladimir I. Levenshtein. TIT, 45(1):284-288, 1999.

1998

Association Schemes and Coding TheoryPhilippe Delsarte, Vladimir I. Levenshtein. TIT, 44(6):2477-2504, 1998.

On designs in compact metric spaces and a universal bound on their sizeVladimir I. Levenshtein. DM, 192(1-3):251-271, 1998. [doi]

1997

On the information function of an error-correcting codeTor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein. TIT, 43(2):549-557, 1997.

Split Orthogonal Arrays and Maximum Independent Resilient Systems of FunctionsVladimir I. Levenshtein. dcc, 12(2):131-160, 1997.

1995

On Upper Bounds for Code Distance and Covering Radius of Designs in Polynomial Metric SpacesG. Fazekas, Vladimir I. Levenshtein. JCT, 70(2):267-288, 1995.

Bounds on the minimum support weightsTor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein, Øyvind Ytrehus. TIT, 41(2):432-440, 1995.

Krawtchouk polynomials and universal bounds for codes and designs in Hamming spacesVladimir I. Levenshtein. TIT, 41(5):1303-1321, 1995.

1994

Superimposed codes in the Hamming spaceThomas H. E. Ericson, Vladimir I. Levenshtein. TIT, 40(6):1882-1893, 1994.

1993

Packing and Decomposition Problems for Polynomial Association SchemesVladimir I. Levenshtein. ejc, 14(5):461-477, 1993. [doi]

Bounds for Codes as Solutions of Extremum Problems for Systems of Orthogonal PolynominalsVladimir I. Levenshtein. AAECC 1993: 25-42

Perfect (d, k)-codes capable of correcting single peak-shiftsVladimir I. Levenshtein, A. J. Han Vinck. TIT, 39(2):656, 1993.

1975

On the Minimal Redundancy of Binary Error-Correcting CodesVladimir I. Levenshtein. iandc, 28(4):268-291, August 1975.

Sign in or sign up to see more results.

runs on WebDSL