Clement W. H. Lam

Patric R. J. Östergård

J. Comb. Theory A, 2012

2011

Finding error-correcting codes using computers.

[BibT_eX]

[DOI]

Proceedings of the Information Security, Coding Theory and Related Combinatorics, 2011

Strongly regular graphs with non-trivial automorphisms.

[BibT_eX]

[DOI]

Majid Behbahani

Discret. Math., 2011

2010

Classification of Generalized Hadamard Matrices H(6,3) and Quaternary Hermitian Self-Dual Codes of Length 18.

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

2005

Symmetric (4,4)-Nets and Generalized Hadamard Matrices Over Groups of Order 4.

[BibT_eX]

[DOI]

Masaaki Harada

Vladimir D. Tonchev

Des. Codes Cryptogr., 2005

Resolvable Maximum Packings with Quadruples.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2005

2004

Whist tournaments with the three person property.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

2003

The extended quadratic residue code is the only (48, 24, 12) self-dual doubly-even code.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

Some new triplewhist tournaments TWh(v).

[BibT_eX]

[DOI]

J. Comb. Theory A, 2003

A note on {4}-GDDs of type 210.

[BibT_eX]

[DOI]

Discret. Math., 2003

Bhaskar Rao designs with block size four.

[BibT_eX]

[DOI]

Discret. Math., 2003

Resolvable group divisible designs with block size four and group size six.

[BibT_eX]

[DOI]

Discret. Math., 2003

2001

Difference Families.

[BibT_eX]

Ying Miao

Des. Codes Cryptogr., 2001

2000

Bounds on the Number of Affine, Symmetric, and Hadamard Designs and Matrices.

[BibT_eX]

[DOI]

Sigmund Lam

Vladimir D. Tonchev

J. Comb. Theory A, 2000

Cyclically resolvable cyclic Steiner triple systems of order 21 and 39.

[BibT_eX]

[DOI]

Ying Miao

Discret. Math., 2000

Three Improvements to the BLASTP Search of Genome Databases.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Scientific and Statistical Database Management, 2000

1999

On Cyclically Resolvable Cyclic Steiner 2-Designs.

[BibT_eX]

[DOI]

Ying Miao

J. Comb. Theory A, 1999

1995

On Quasi-Symmetric 2-(28, 12, 11) and 2-(36, 16, 12) Designs.

[BibT_eX]

[DOI]

Vladimir D. Tonchev

Des. Codes Cryptogr., 1995

Design and Analysis of Hierarchical Ring Networks for Shared-Memory Multiprocessors.

[BibT_eX]

Hong Jiang

V. Carl Hamacher

Proceedings of the 1995 International Conference on Parallel Processing, 1995

1994

Balanced 6 × 6 designs for 4 equally replicated treatments.

[BibT_eX]

[DOI]

Discret. Math., 1994

The Preliminary Design of an Object-Oriented Framework for Combinatorial Enumeration.

[BibT_eX]

Gregory Butler

Proceedings of the Object-Oriented Technology for Database and Software Systems, 1994

1991

A computer search for finite projective planes of order 9.

[BibT_eX]

[DOI]

Galina Kolesova

Discret. Math., 1991

Application of Group Theory to Combinatorial Searches.

[BibT_eX]

[DOI]

Proceedings of the Groups And Computation, 1991

1990

There is no (24, 12, 10) self-dual quaternary code.

[BibT_eX]

[DOI]

Vera Pless

IEEE Trans. Inf. Theory, 1990

On the number of 8×8 latin squares.

[BibT_eX]

[DOI]

Galina Kolesova

J. Comb. Theory A, 1990

1989

Restructuring for Fault-Tolerant Systolic Arrays.

[BibT_eX]

[DOI]

Hon Fung Li

R. Jayakumar

IEEE Trans. Computers, 1989

A Study of Two Approaches for Reconfiguring Fault-Tolerant Systolic Arrays.

[BibT_eX]

[DOI]

Hon Fung Li

R. Jayakumar

IEEE Trans. Computers, 1989

Backtrack Search with Isomorph Rejection and Consistency Check.

[BibT_eX]

[DOI]

J. Symb. Comput., 1989

1986

The nonexistence of code words of weight 16 in a projective plane of order 10.

[BibT_eX]

[DOI]

Stan Swiercz

J. Comb. Theory A, 1986

1985

A General Backtrack Algorithm for the Isomorphism Problem of Combinatorial Objects.

[BibT_eX]

[DOI]

Gregory Butler

J. Symb. Comput., 1985

1984

More Coverings by Rook Domains.

[BibT_eX]

[DOI]

Aart Blokhuis

J. Comb. Theory A, 1984

1983

The Existence and Nonexistence of Perfect Addition Sets.

[BibT_eX]

[DOI]

Siu Lun Ma

M. K. Siu

J. Comb. Theory A, 1983

The nonexistence of ovals in a projective plane of order 10.

[BibT_eX]

[DOI]

Discret. Math., 1983

Non-skew symmetric orthogonal matrices with constant diagonals.

[BibT_eX]

[DOI]

Discret. Math., 1983

1982

Three New Combination Algorithms with the Minimal Change Property.

[BibT_eX]

[DOI]

Leonard H. Soicher

Commun. ACM, 1982

NOVAC: a non-tree variable tree for combinatorial computing.

[BibT_eX]

Bipin C. Desai

Proceedings of the International Conference on Parallel Processing, 1982

1980

Distance transitive digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1980

1978

Directed graphs with unique paths of fixed length.

[BibT_eX]

[DOI]

Jack H. van Lint

J. Comb. Theory B, 1978

1977

Cyclotomy and Addition Sets.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1977

On Some Solutions of Ak = dl + lambda J.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1977

The distribution of 1-widths of (0, 1)-matrices.

[BibT_eX]

[DOI]

Discret. Math., 1977

1976

Nth Power Residue Addition Sets.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1976

1975

A Generalization of Cyclic Difference Sets II.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1975

A Generalization of Cyclic Difference Sets I.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1975

1973

Arithmetic Overa Finite Field [A1] (Algorithm 469).

[BibT_eX]