Large sets with multiplicity

DOI10.1007/s10623-021-00878-4zbMath1466.05012arXiv2007.09608OpenAlexW3165378128MaRDI QIDQ2035460

Tuvi Etzion, Junling Zhou

Publication date: 24 June 2021

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.09608

zbMATH Keywords

permutationsLatin squaresSteiner systemslarge setsone-factorizationsordered designsperpendicular arraysH-designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Triple systems (05B07)

Related Items

Constructions for new orthogonal arrays based on large sets of orthogonal arrays

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• On large sets of disjoint Steiner triple systems. VI
• The combinatorics of authentication and secrecy codes
• On large sets of disjoint Steiner triple systems. III
• Covering triples by quadruples: an asymptotic solution
• A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
• Halving \(\mathrm{PGL}(2,2^f)\), \(f\) odd: a series of cryptocodes
• Some highly symmetric authentication perpendicular arrays
• Some perpendicular arrays for arbitrarily large \(t\)
• Monotypical uniformly homogeneous sets of permutations
• Further results on large sets of disjoint group-divisible designs
• Halving \(\text{PSL}(2,q)\)
• Orthogonal arrays. Theory and applications
• The fundamental construction for 3-designs
• Counting designs
• The uniformly 3-homogeneous subsets of PGL\((2,q)\)
• Locally trivial t-designs and t-designs without repeated blocks
• Some \(t\)-homogeneous sets of permutations
• Combinatorial solutions providing improved security for the generalized Russian cards problem
• Probabilistic existence of regular combinatorial structures
• Bounds and constructions of \(t\)-spontaneous emission error designs
• A new existence proof for large sets of disjoint Steiner triple systems
• A NEW NOTION OF TRANSITIVITY FOR GROUPS AND SETS OF PERMUTATIONS
• An improvement on H design
• A Combinatorial Approach to Threshold Schemes
• Towards a Large Set of Steiner Quadruple Systems
• On threshold schemes from large sets
• A complete solution to existence of H designs
• Theory of perpendicular arrays
• Large sets with holes
• A recursive construction of t -wise uniform permutations