Split Orthogonal Arrays and Maximum Independent ResilientSystems of Functions
Designs, Codes and Cryptography
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra
European Journal of Combinatorics
Commutative association schemes
European Journal of Combinatorics
| Hi-index | 0.00 |
A number of importantfamilies of association schemes—such as the Hamming andJohnson schemes—enjoy the property that, in each memberof the family, Delsarte t-designs can be characterisedcombinatorially as designs in a certain partially ordered setattached to the scheme. In this paper, we extend this characterisationto designs in a product association scheme each of whose componentsadmits a characterisation of the above type. As a consequenceof our main result, we immediately obtain linear programmingbounds for a wide variety of combinatorial objects as well asbounds on the size and degree of such designs analogous to Delsarte‘sbounds for t-designs in Q-polynomialassociation schemes.