Incidence matrices and inequalities for combinatorial designs
From MaRDI portal
Publication:2782294
DOI10.1002/jcd.1026zbMath1005.05010OpenAlexW2074807297MaRDI QIDQ2782294
Mohan S. Shrikhande, S. S. Shrikhande, Damaraju Raghavarao
Publication date: 17 October 2002
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.1026
Combinatorial aspects of block designs (05B05) Combinatorial inequalities (05A20) Orthogonal arrays, Latin squares, Room squares (05B15)
Related Items (5)
Further results on mutually nearly orthogonal Latin squares ⋮ Difference covering arrays and pseudo-orthogonal Latin squares ⋮ A natural generalization of orthogonality of Latin squares ⋮ Direct Constructions for General Families of Cyclic Mutually Nearly Orthogonal Latin Squares ⋮ High-rate LDPC codes from partially balanced incomplete block designs
Cites Work
- Unnamed Item
- Incidence matrices of t-designs
- Repeated measurements designs, II
- Resolvable pairwise balanced designs.
- Some results on tactical configurations and non-existence of difference set solutions for certain symmetrical PBIB designs
- On the Composition of Balanced Incomplete Block Designs
- Generalized Right Angular Designs
- An Inequality for Doubly Balanced Incomplete Block Designs
- A Note on Fisher's Inequality for Balanced Incomplete Block Designs
- On some Theorems in Combinatorics Relating to Incomplete Block Designs
This page was built for publication: Incidence matrices and inequalities for combinatorial designs