Vladimir I. Levenshtein

Johannes Siemons

J. Comb. Theory A, 2009

2008

A conjecture on the reconstruction of graphs from metric balls of their vertices.

[BibT_eX]

[DOI]

Discret. Math., 2008

Reconstruction of a graph from 2-vicinities of its vertices.

[BibT_eX]

[DOI]

Elena V. Konstantinova

Eugene Konstantinov

Sergey G. Molodtsov

Discret. Appl. Math., 2008

2007

Conflict-avoiding codes and cyclic triple systems.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2007

2006

On Minimum Girth of Graphs Reconstructible from Metric Balls of Their Vertices.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

A bound for codes with given minimum and maximum distances.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

06201 Abstracts Collection -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery.

[BibT_eX]

[DOI]

Rudolf Ahlswede

Alberto Apostolico

Proceedings of the Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05., 2006

06201 Executive Summary -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery.

[BibT_eX]

[DOI]

Rudolf Ahlswede

Alberto Apostolico

Proceedings of the Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05., 2006

2005

Error-correction capability of binary linear codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

Reconstruction of a graph from 2-vicinities of its vertices<sup>, </sup>.

[BibT_eX]

[DOI]

Elena V. Konstantinova

Eugene Konstantinov

Sergey G. Molodtsov

Electron. Notes Discret. Math., 2005

Optimal conflict-avoiding codes for three active users.

[BibT_eX]

[DOI]

Vladimir D. Tonchev

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004

The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

A system of polynomials for the complex hamming spaces.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003

A universal bound for a covering in regular posets and its application to pool testing.

[BibT_eX]

[DOI]

Discret. Math., 2003

Hypercubic 4 and 5-Designs from Double-Error-Correcting BCH Codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2003

Application of Cover-free Codes and Combinatorial Designs to Two-stage Testing.

[BibT_eX]

[DOI]

Toby Berger

Discret. Appl. Math., 2003

A coset weight count that proves that the simplex codes are not optimal for error correction.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

2002

Asymptotic efficiency of two-stage disjunctive testing.

[BibT_eX]

[DOI]

Toby Berger

IEEE Trans. Inf. Theory, 2002

2001

Efficient reconstruction of sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

Efficient Reconstruction of Sequences from Their Subsequences or Supersequences.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2001

1999

New Lower Bounds on Aperiodic Crosscorrelation of Binary Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications.

[BibT_eX]

[DOI]

Discret. Math., 1999

1998

Association Schemes and Coding Theory.

[BibT_eX]

[DOI]

Philippe Delsarte

IEEE Trans. Inf. Theory, 1998

On designs in compact metric spaces and a universal bound on their size.

[BibT_eX]

[DOI]

Discret. Math., 1998

1997

On the information function of an error-correcting code.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

Split Orthogonal Arrays and Maximum Independent Resilient Systems of Functions.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1997

1995

Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

Bounds on the minimum support weights.

[BibT_eX]

[DOI]

Øyvind Ytrehus

IEEE Trans. Inf. Theory, 1995

On Upper Bounds for Code Distance and Covering Radius of Designs in Polynomial Metric Spaces.

[BibT_eX]

G. Fazekas

J. Comb. Theory A, 1995

1994

Superimposed codes in the Hamming space.

[BibT_eX]

[DOI]

Thomas H. E. Ericson

IEEE Trans. Inf. Theory, 1994

1993

Perfect (d, k)-codes capable of correcting single peak-shifts.

[BibT_eX]

[DOI]

A. J. Han Vinck

IEEE Trans. Inf. Theory, 1993

Packing and Decomposition Problems for Polynomial Association Schemes.

[BibT_eX]

[DOI]

Eur. J. Comb., 1993

Bounds for Codes as Solutions of Extremum Problems for Systems of Orthogonal Polynominals.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1993

1975

On the Minimal Redundancy of Binary Error-Correcting Codes

[BibT_eX]

[DOI]