Richard M. Wilson
According to our database^{1},
Richard M. Wilson
authored at least 34 papers
between 1972 and 2014.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at zbmath.org

at id.loc.gov

at dnb.info
On csauthors.net:
Bibliography
2014
Diagonal forms of incidence matrices associated with ttuniform hypergraphs.
Eur. J. Comb., 2014
2013
Covering and packing for pairs.
J. Comb. Theory, Ser. A, 2013
2011
Codes and modules associated with designs and tuniform hypergraphs.
Proceedings of the Information Security, Coding Theory and Related Combinatorics, 2011
Diagonal forms for incidence matrices and zerosum Ramsey theory.
Electronic Notes in Discrete Mathematics, 2011
2009
On set systems with restricted intersections modulo p and pary tdesigns.
Discrete Mathematics, 2009
2008
More on decompositions of edgecolored complete graphs.
Discrete Mathematics, 2008
2007
The cone condition and tdesigns.
Eur. J. Comb., 2007
2006
Set Systems with No Singleton Intersection.
SIAM J. Discrete Math., 2006
A lemma on polynomials modulo p^{m} and applications to coding theory.
Discrete Mathematics, 2006
On resolvable designs.
Discrete Mathematics, 2006
2000
Decompositions of EdgeColored Complete Graphs.
J. Comb. Theory, Ser. A, 2000
1999
Signed Hypergraph Designs and Diagonal Forms for Some Incidence Matrices.
Des. Codes Cryptography, 1999
1997
Constructions of Hadamard Difference Sets.
J. Comb. Theory, Ser. A, 1997
1993
Hyperplane Sections of Fermat Varieties in P^{3} in Char.2 and Some Applications to Cyclic Codes.
Proceedings of the Applied Algebra, 1993
1992
A course in combinatorics.
Cambridge University Press, ISBN: 9780521410571, 1992
1991
Four Pairwise Balanced Designs.
Des. Codes Cryptography, 1991
1990
A Diagonal Form for the Incidence Matrices of tSubsets vs.kSubsets.
Eur. J. Comb., 1990
1989
Short codes with a given coveting radius.
IEEE Trans. Information Theory, 1989
Quasirandom graphs.
Combinatorica, 1989
1988
The number of submatrices of a given type in a Hadamard matrix and related results.
J. Comb. Theory, Ser. B, 1988
1986
Binary cyclic codes generated by mira7.
IEEE Trans. Information Theory, 1986
On the minimum distance of cyclic codes.
IEEE Trans. Information Theory, 1986
The ErdösKoRado theorem for vector spaces.
J. Comb. Theory, Ser. A, 1986
1985
On 2Designs.
J. Comb. Theory, Ser. A, 1985
1984
The exact bound in the Erdös  Ko  Rado theorem.
Combinatorica, 1984
1983
On the Preparata and Goethals codes.
IEEE Trans. Information Theory, 1983
Inequalities for t Designs.
J. Comb. Theory, Ser. A, 1983
1981
Intersection theorems with geometric consequences.
Combinatorica, 1981
1975
An Existence Theory for Pairwise Balanced Designs, III: Proof of the Existence Conjectures.
J. Comb. Theory, Ser. A, 1975
1974
Concerning the number of mutually orthogonal latin squares.
Discrete Mathematics, 1974
1973
Embeddings of Steiner triple systems.
Discrete Mathematics, 1973
1972
An Existence Theory for Pairwise Balanced Designs II. The Structure of PBDClosed Sets and the Existence Conjectures.
J. Comb. Theory, Ser. A, 1972
An Existence Theory for Pairwise Balanced Designs I. Composition Theorems and Morphisms.
J. Comb. Theory, Ser. A, 1972
On resolvable designs.
Discrete Mathematics, 1972