Clement W. H. Lam

Affiliations:
  • Concordia University, Montreal, Canada


According to our database1, Clement W. H. Lam authored at least 45 papers between 1973 and 2012.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2012
On triple systems and strongly regular graphs.
J. Comb. Theory A, 2012

2011
Finding error-correcting codes using computers.
Proceedings of the Information Security, Coding Theory and Related Combinatorics, 2011

Strongly regular graphs with non-trivial automorphisms.
Discret. Math., 2011

2010
Classification of Generalized Hadamard Matrices <i>H(6,3)</i> and Quaternary Hermitian Self-Dual Codes of Length 18.
Electron. J. Comb., 2010

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

Resolvable Maximum Packings with Quadruples.
Des. Codes Cryptogr., 2005

2004
Whist tournaments with the three person property.
Discret. Appl. Math., 2004

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

Some new triplewhist tournaments TWh(v).
J. Comb. Theory A, 2003

A note on {4}-GDDs of type 2<sup>10</sup>.
Discret. Math., 2003

Bhaskar Rao designs with block size four.
Discret. Math., 2003

Resolvable group divisible designs with block size four and group size six.
Discret. Math., 2003

2001
Difference Families.
Des. Codes Cryptogr., 2001

2000
Bounds on the Number of Affine, Symmetric, and Hadamard Designs and Matrices.
J. Comb. Theory A, 2000

Cyclically resolvable cyclic Steiner triple systems of order 21 and 39.
Discret. Math., 2000

Three Improvements to the BLASTP Search of Genome Databases.
Proceedings of the 12th International Conference on Scientific and Statistical Database Management, 2000

1999
On Cyclically Resolvable Cyclic Steiner 2-Designs.
J. Comb. Theory A, 1999

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

Design and Analysis of Hierarchical Ring Networks for Shared-Memory Multiprocessors.
Proceedings of the 1995 International Conference on Parallel Processing, 1995

1994
Balanced 6 × 6 designs for 4 equally replicated treatments.
Discret. Math., 1994

The Preliminary Design of an Object-Oriented Framework for Combinatorial Enumeration.
Proceedings of the Object-Oriented Technology for Database and Software Systems, 1994

1991
A computer search for finite projective planes of order 9.
Discret. Math., 1991

Application of Group Theory to Combinatorial Searches.
Proceedings of the Groups And Computation, 1991

1990
There is no (24, 12, 10) self-dual quaternary code.
IEEE Trans. Inf. Theory, 1990

On the number of 8×8 latin squares.
J. Comb. Theory A, 1990

1989
Restructuring for Fault-Tolerant Systolic Arrays.
IEEE Trans. Computers, 1989

A Study of Two Approaches for Reconfiguring Fault-Tolerant Systolic Arrays.
IEEE Trans. Computers, 1989

Backtrack Search with Isomorph Rejection and Consistency Check.
J. Symb. Comput., 1989

1986
The nonexistence of code words of weight 16 in a projective plane of order 10.
J. Comb. Theory A, 1986

1985
A General Backtrack Algorithm for the Isomorphism Problem of Combinatorial Objects.
J. Symb. Comput., 1985

1984
More Coverings by Rook Domains.
J. Comb. Theory A, 1984

1983
The Existence and Nonexistence of Perfect Addition Sets.
J. Comb. Theory A, 1983

The nonexistence of ovals in a projective plane of order 10.
Discret. Math., 1983

Non-skew symmetric orthogonal matrices with constant diagonals.
Discret. Math., 1983

1982
Three New Combination Algorithms with the Minimal Change Property.
Commun. ACM, 1982

NOVAC: a non-tree variable tree for combinatorial computing.
Proceedings of the International Conference on Parallel Processing, 1982

1980
Distance transitive digraphs.
Discret. Math., 1980

1978
Directed graphs with unique paths of fixed length.
J. Comb. Theory B, 1978

1977
Cyclotomy and Addition Sets.
J. Comb. Theory A, 1977

On Some Solutions of A<sup>k</sup> = dl + lambda J.
J. Comb. Theory A, 1977

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

1976
Nth Power Residue Addition Sets.
J. Comb. Theory A, 1976

1975
A Generalization of Cyclic Difference Sets II.
J. Comb. Theory A, 1975

A Generalization of Cyclic Difference Sets I.
J. Comb. Theory A, 1975

1973
Arithmetic Overa Finite Field [A1] (Algorithm 469).
Commun. ACM, 1973


  Loading...