Access the full text.
Sign up today, get DeepDyve free for 14 days.
R. Bruck, H. Ryser (1949)
The Nonexistence of Certain Finite Projective PlanesCanadian Journal of Mathematics, 1
B. Chor, Oded Goldreich (1989)
On the power of two-point based samplingJ. Complex., 5
H. Ryser (1950)
A note on a combinatorial problem, 1
Timo Neumann (2006)
BENT FUNCTIONS
(1976)
On the λ-design conjecture
C. Colbourn, J. Dinitz (1996)
Making the Mols Table
D. Jungnickel, S. Vanstone (1986)
On resolvable designs S3(3; 4, v)J. Comb. Theory, Ser. A, 43
J. Singer (1938)
A theorem in finite projective geometry and some applications to number theoryTransactions of the American Mathematical Society, 43
M. Behbahani (2004)
On orthogonal matrices
R. Stanton, R. Mullin, J. Lawless (1968)
Quasi-residual designsaequationes mathematicae, 1
R. Craigen, H. Kharaghani (1994)
On the existence of regular Hadamard matrices
P. Cameron, J. Lint (1991)
Designs, graphs, codes, and their links
(1973)
The necessary conditions for t-designs are sufficient for something
A. Shamir (1979)
How to share a secretCommun. ACM, 22
J. Seberry, M. Yamada (1992)
Hadamard matrices, Sequences, and Block Designs
Rudolf Lide, H. Niederreiter (1983)
Finite fields
Douglas Stinson (1993)
Combinatorial designs and cryptography
(1999)
to Coding Theory, Third Edition
Yury Ionin, K. Mackenzie-Fleming (2002)
A technique for constructing non‐embeddable quasi‐residual designsJournal of Combinatorial Designs, 10
C. Colbourn, J. Dinitz (1996)
CRC Handbook of Combinatorial DesignsJournal of the American Statistical Association, 92
Douglas Stinson (1987)
Frames for Kirkman triple systemsDiscret. Math., 65
E. Assmus, J. Key (1992)
Designs and their codes, 103
L. Chouinard, R. Jajcay, S. Magliveras, Hugh Williams, G. Royle, L. Andersen, A. Brouwer, E. Spence, A. Beutelspacher, M. Resmini, P. Gibbons (2006)
Computational Methods in Design Theory
R. Rees, Douglas Stinson (1992)
Combinatorial Characterizations of Authentication Codes IIDesigns, Codes and Cryptography, 7
Yin Jianxing, Miao Ying, S. Furino (1996)
Frames and Resolvable Designs: Uses, Constructions and Existence
I. Anderson (1998)
Combinatorial Designs and Tournaments
R. Rees (1986)
Minimal clique partitions and pairwise balanced designsDiscret. Math., 61
Eric Lander (1983)
Symmetric Designs: An Algebraic Approach
K. Gopalakrishnan, Douglas Stinson (1996)
A Simple Analysis of the Error Probability of Two-Point Based SamplingInf. Process. Lett., 60
J. Dinitz, Douglas Stinson (1992)
Contemporary design theory : a collection of surveys
Douglas Stinson (1984)
A Short Proof of the Nonexistence of a Pair of Orthogonal Latin Squares of Order SixJ. Comb. Theory, Ser. A, 36
E. Dawson, E. Mahmoodian, A. Rahilly (1993)
Orthogonal arrays and ordered threshold schemesAustralas. J Comb., 8
C. Colbourn, J. Dinitz (2001)
Mutually orthogonal latin squares: a brief survey of constructionsJournal of Statistical Planning and Inference, 95
M. Schutzenberger (1949)
A non-existence theorem for an infinite family of symmetrical block designs.Annals of eugenics, 14 4
H. Hanani (1961)
The Existence and Construction of Balanced Incomplete Block DesignsAnnals of Mathematical Statistics, 32
H.J Ryser (1968)
An extension of a theorem of de Bruijn and Erdös on combinatorial designsJournal of Algebra, 10
P. Erdös, R. Mullin, V. Sós, Douglas Stinson (1983)
Finite linear spaces and projective planesDiscret. Math., 47
J. Bierbrauer, K. Gopalakrishnan, Douglas Stinson (1996)
Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming BoundsSIAM J. Discret. Math., 9
W. Wallis (1971)
Construction of strongly regular graphs using affine designsBulletin of the Australian Mathematical Society, 4
R. Wilson (1974)
Concerning the number of mutually orthogonal latin squaresDiscret. Math., 9
F. MacWilliams, N. Sloane (1977)
The Theory of Error-Correcting Codes
R. Fisher (1940)
An examination of the different possible solutions of a problem in incomplete blocks.Annals of Human Genetics, 10
G. Blakley (1899)
Safeguarding cryptographic keys1979 International Workshop on Managing Requirements Knowledge (MARK)
R. Mullin, E. Nemeth (1969)
An Existence Theorem for Room Squares*Canadian Mathematical Bulletin, 12
Douglas Stinson, S. Vanstone (1987)
A Combinatorial Approach to Threshold SchemesSIAM J. Discret. Math., 1
Robert Patten (1995)
Combinatorics: Topics, Techniques, Algorithms
(1996)
science: selected applications
M. Hall, W. Connor (1954)
An Embedding Theorem for Balanced Incomplete Block DesignsCanadian Journal of Mathematics, 6
J. Lint, V. Tonchev (1984)
Nonembeddable Quasi-residual Designs with Large KJ. Comb. Theory, Ser. A, 37
(1987)
Hyperfactorizations of graphs and 5designs
R. McEliece (1986)
Finite Fields for Computer Scientists and Engineers
L. Teirlinck (2006)
Non-trivial t-designs without repeated blocks exist for all tDiscret. Math., 65
C. Koukouvinos, J. Seberry (1999)
New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function – a reviewJournal of Statistical Planning and Inference, 81
R. Bose (1939)
ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNSAnnals of Human Genetics, 9
Th. Skolem (1958)
Some Remarks on the Triple Systems of Steiner.Mathematica Scandinavica, 6
R. Craigen (1995)
Signed Groups, Sequences, and the Asymptotic Existence of Hadamard MatricesJ. Comb. Theory, Ser. A, 71
(1970)
λ-μ problem: λ = 1 and μ = 3
E. Kramer, D. Mesner (1976)
T-designs on HypergraphsDiscret. Math., 15
M. Hall, H. Ryser (1951)
Cyclic Incidence MatricesCanadian Journal of Mathematics, 3
C. Colbourn, J. Dinitz, Douglas Stinson (1999)
Surveys in Combinatorics, 1999: Applications of Combinatorial Designs to Communications, Cryptography, and Networking
R. Wilson (1975)
An Existence Theory for Pairwise Balanced Designs, III: Proof of the Existence ConjecturesJ. Comb. Theory, Ser. A, 18
L. Baumert (1971)
Cyclic Difference Sets
Jr. Hall (1947)
Cyclic projective planesDuke Mathematical Journal, 14
S. Shrikhande (1976)
Affine resolvable balanced incomplete block designs: A surveyaequationes mathematicae, 14
(1971)
of Kirkman’s schoolgirl problem
R. Bruckc (2010)
DIFFERENCE SETS IN A FINITE GROUP
C. Colbourn, J. Dinitz, Douglas Stinson (1999)
CORR 99-01 Applications of Combinatorial Designs to Communications , Cryptography , and Networking
J. Williamson (1944)
Hadamard’s determinant theorem and the sum of four squaresDuke Mathematical Journal, 11
Resilient functions and large sets of orthogonal arrays
B. Chor, Oded Goldreich, J. Håstad, J. Friedman, S. Rudich, R. Smolensky (1985)
The bit extraction problem or t-resilient functions26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
R. Wilson (1972)
Cyclotomy and difference families in elementary abelian groupsJournal of Number Theory, 4
E. Witt (1937)
über Steinersche SystemeAbhandlungen aus dem Mathematischen Seminar der Universität Hamburg, 12
Afdeling Zuivere (1976)
The excess of a hadamard matrix, 80
Donald Kreher, R. Rees (2001)
A hole‐size bound for incomplete t‐wise balanced designsJournal of Combinatorial Designs, 9
R. Laue (2006)
T-wise Balanced DesignsDiscret. Appl. Math., 157
L. Baumert, S. Golomb, M. Hall (1962)
Discovery of an Hadamard matrix of order 92Bulletin of the American Mathematical Society, 68
Douglas Stinson (1991)
Combinatorial characterizations of authentication codesDesigns, Codes and Cryptography, 2
C. Colbourn (1995)
Construction Techniques for Mutually Orthogonal Latin Squares
(1990)
On the number of blocks in a perfect covering of v points
Clement Lam, L. Thiel, S. Swiercz (1989)
The Non-Existence of Finite Projective Planes of Order 10Canadian Journal of Mathematics, 41
D. Hughes (1985)
Design Theory
Gholamreza Khosroyshahi, R. Laue (2006)
t -Designs with t ≥ 3
J. Dillon (1974)
Elementary Hadamard Difference Sets
Charles Bennett, G. Brassard, J. Robert (1988)
Privacy Amplification by Public DiscussionSIAM J. Comput., 17
R. Wilson (1972)
An Existence Theory for Pairwise Balanced Designs I. Composition Theorems and MorphismsJ. Comb. Theory, Ser. A, 13
(2000)
Testing and Its Applications, Second Edition
J. Lint, R. Wilson (1992)
A course in combinatorics
C. Colbourn, P. Oorschot (1989)
Applications of combinatorial designs in computer scienceACM Comput. Surv., 21
E. Gilbert, F. MacWilliams, N. Sloane (1974)
Codes which detect deceptionBell System Technical Journal, 53
R. Bose, S. Shrikhande (1960)
On the construction of sets of mutually orthogonal Latin squares and the falsity of a conjecture of EulerTransactions of the American Mathematical Society, 95
G. Simmons (1988)
A survey of information authenticationProc. IEEE, 76
R. Craigen, W. Wallis (1993)
Hadamard matrices: 1893--1993
R. Wilson (1975)
Constructions and Uses of Pairwise Balanced Designs
R. Wilson (1972)
An Existence Theory for Pairwise Balanced Designs II. The Structure of PBD-Closed Sets and the Existence ConjecturesJ. Comb. Theory, Ser. A, 13
R. Bose, S. Shrikhande, E. Parker (1960)
Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's ConjectureCanadian Journal of Mathematics, 12
L. Deng (1999)
Orthogonal Arrays: Theory and ApplicationsTechnometrics, 42
Steven Roman (1992)
Coding and information theory
L. Pigno (1970)
A multiplier theorem.Pacific Journal of Mathematics, 34
de Bruijn (1946)
A combinatorial problem, 49
H. Hanani (1960)
On Quadruple SystemsCanadian Journal of Mathematics, 12
3. Modelling Distributed Systems by Fokkink. Misc Books 1. Quantum Computing Without Magic by Meglicki. 2. Advanced Data Structures by Peter Brass. 3. Introduction to Information Retrieval by Manning, Raghavan, and Schutze. 4. Higher Arithmetic: An algorithmic introduction to Number Theory 5. A Conscise introduction to Data Compression by Salomon. 6. Putting Auction Theory to Work by Paul Milgrom. 7. Di erence Equations: From Rabbits to Chaos by Cull, Flahive, and Robson. Review of 1 Combinatorial Designs: Constructions and Analysis Author of Book: Douglas R. Stinson Springer-Verlag, New York, 2004, 300 pages Review by R. Gregory Taylor Introduction The origins of combinatorial design theory lie within recreational mathematics. With the work of Fisher and Yates in the 1930s it began to take on the character of a serious academic subject with deep connections to linear algebra, group theory, and number theory; there are applications to statistical experimentation, tournament scheduling, mathematical biology, algorithm design and analysis, and cryptography. The basic notion is that of a design, whereby one intends a pair (X, A) with X any set of elements (or points) and A any multiset of nonempty subsets of X (termed blocks). (If A is a set, then (X,
ACM SIGACT News – Association for Computing Machinery
Published: Nov 30, 2008
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.