Vladimir I. Levenshtein Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir I. Levenshtein, Johannes Siemons: Error graphs and the reconstruction of elements in groups. J. Comb. Theory, Ser. A 116(4): 795-815 (2009)
2008
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir 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)
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir I. Levenshtein: A conjecture on the reconstruction of graphs from metric balls of their vertices. Discrete Mathematics 308(5-6): 993-998 (2008)
2006
27no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRudolf 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
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRudolf 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
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRudolf 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
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir 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)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTor 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
22no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTor 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
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTor 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)
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToby Berger, Vladimir I. Levenshtein: Application of Cover-free Codes and Combinatorial Designs to Two-stage Testing. Discrete Applied Mathematics 128(1): 11-26 (2003)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir 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
18no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToby Berger, Vladimir I. Levenshtein: Asymptotic efficiency of two-stage disjunctive testing. IEEE Transactions on Information Theory 48(7): 1741-1749 (2002)
2001
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToby 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)
16no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir I. Levenshtein: Efficient reconstruction of sequences. IEEE Transactions on Information Theory 47(1): 2-22 (2001)
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir I. Levenshtein: Efficient Reconstruction of Sequences from Their Subsequences or Supersequences. J. Comb. Theory, Ser. A 93(2): 310-332 (2001)
1999
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir 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)
13no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir I. Levenshtein: New Lower Bounds on Aperiodic Crosscorrelation of Binary Codes. IEEE Transactions on Information Theory 45(1): 284-288 (1999)
1998
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir I. Levenshtein: On designs in compact metric spaces and a universal bound on their size. Discrete Mathematics 192(1-3): 251-271 (1998)
11no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPhilippe Delsarte, Vladimir I. Levenshtein: Association Schemes and Coding Theory. IEEE Transactions on Information Theory 44(6): 2477-2504 (1998)
1997
10no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir I. Levenshtein: Split Orthogonal Arrays and Maximum Independent Resilient Systems of Functions. Des. Codes Cryptography 12(2): 131-160 (1997)
9no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTor 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
8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTor 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)
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir I. Levenshtein: Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces. IEEE Transactions on Information Theory 41(5): 1303-1321 (1995)
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLG. 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
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLThomas H. E. Ericson, Vladimir I. Levenshtein: Superimposed codes in the Hamming space. IEEE Transactions on Information Theory 40(6): 1882-1893 (1994)
1993
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir I. Levenshtein: Bounds for Codes as Solutions of Extremum Problems for Systems of Orthogonal Polynominals. AAECC 1993: 25-42
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir I. Levenshtein: Packing and Decomposition Problems for Polynomial Association Schemes. Eur. J. Comb. 14(5): 461-477 (1993)
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir 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
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVladimir I. Levenshtein: On the Minimal Redundancy of Binary Error-Correcting Codes Information and Control 28(4): 268-291 (1975)

Coauthor Index

1Rudolf Ahlswede [25] [26] [27]
2Alberto Apostolico [25] [26] [27]
3Toby Berger [17] [18] [20]
4Philippe Delsarte [11]
5Thomas H. E. Ericson [5]
6G. Fazekas [6]
7Tor Helleseth [8] [9] [21] [22] [23]
8Torleiv Kløve [8] [9] [21] [22] [23]
9Eugene Konstantinov [24] [29]
10Elena V. Konstantinova [24] [29]
11Sergey Molodtsov [24] [29]
12Johannes Siemons [30]
13A. J. Han Vinck [2]
14Øyvind Ytrehus [8]

Colors in the list of coauthors

Copyright © Sun Mar 14 22:39:24 2010 by Michael Ley (ley@uni-trier.de)