Design theory
Expanders, sorting in rounds and superconcentrators of limited depth
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Non-trivial t-designs without repeated blocks exist for all t
Discrete Mathematics
Applications of combinatorial designs in computer science
ACM Computing Surveys (CSUR)
Bisectional Fault-Tolerant Communication Architecture for Supercomputer Systems
IEEE Transactions on Computers
The Organization of Permutation Architectures with Bused Interconnections
IEEE Transactions on Computers
Combinatorial designs and cryptography
Surveys in combinatorics, 1993
On the upper bound of the size of the r-cover-free families
Journal of Combinatorial Theory Series A
A powerful method for constructing difference families and optimal optical orthogonal codes
Designs, Codes and Cryptography
Optimal pooling designs with error detection
Journal of Combinatorial Theory Series A
Discrete Applied Mathematics
Combinatorial design of congestion-free networks
IEEE/ACM Transactions on Networking (TON)
Some combinational constructions for optical orthogonal codes
Discrete Mathematics
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
SIAM Journal on Discrete Mathematics
Some new bounds for cover-free families
Journal of Combinatorial Theory Series A
Maximum Kirkman Signal Sets for Synchronous Uni-Polar Multi-UserCommunication Systems
Designs, Codes and Cryptography
Quorums from difference covers
Information Processing Letters
Projective planes and congestion-free networks
Discrete Applied Mathematics
On Constructions for Optimal Optical Orthogonal Codes
Proceedings of the First French-Israeli Workshop on Algebraic Coding
Efficient Collective Communication in Optical Networks
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
| Hi-index | 0.00 |
In the past century, combinatorial designs have had substantial application in the statistical design of experiments and in the theory of error-correcting codes. Applications in experimental and theoretical computer science have emergedmore recently, along with connections to the theory of cryptographic communication. This paper focuses on applications of designs in multiple access communications, in particular to balanced methods of sharing resources such as communications hardware, time, and bandwidth. The theory of combinatorial designs continues to grow, in part as a consequence of the variety of these applications andthe increasing depth of the connections with challenging problems on designs.