An infinite class of 4-designs

DOI10.1016/S0021-9800(69)80096-7zbMath0169.01903OpenAlexW2044703300MaRDI QIDQ5555709

W. O. Alltop

Publication date: 1969

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0021-9800(69)80096-7

zbMATH Keywords

combinatorics

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Related Items (20)

An incidence algebra for t-designs with automorphisms ⋮ Point-missing \(s\)-resolvable \(t\)-designs: infinite series of 4-designs with constant index ⋮ Remark on the generalized graph extension theorem ⋮ Resolutions of the designs in two infinite series of 4-designs ⋮ The family of t-designs. Part I ⋮ On t‐designs and s‐resolvable t‐designs from hyperovals ⋮ Orbits on the projective line ⋮ New Lower Bounds for Binary Constant-Dimension Subspace Codes ⋮ A recursive construction for simple \(t\)-designs using resolutions ⋮ Designs with block-size 6 in projective planes of characteristic 2 ⋮ A class of three-designs ⋮ 5-design and counter 5-design in the binary Golay code of length 24 ⋮ Retracted article: ``Constructions for \(t\)-designs and \(s\)-resolvable \(t\)-designs ⋮ On the construction of authentication and secrecy codes ⋮ An infinite class of 5-designs ⋮ On simple 3-designs having 2-resolutions ⋮ A family of 4-designs with block size 9 ⋮ Recursive constructions for \(s\)-resolvable \(t\)-designs ⋮ Two new families of 4-designs ⋮ A family of perpendicular arrays achieving perfect 4-fold secrecy

This page was built for publication: An infinite class of 4-designs