Asymptotic determination of the last packing number of quadruples

DOI10.1007/s10623-004-5662-9zbMath1172.05311OpenAlexW2072390604MaRDI QIDQ2491259

Lijun Ji

Publication date: 29 May 2006

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

Full work available at URL: https://doi.org/10.1007/s10623-004-5662-9

zbMATH Keywords

packing designconstant weight codecandelabra system

Mathematics Subject Classification ID

Combinatorial codes (94B25) Combinatorial aspects of packing and covering (05B40)

Related Items

Packing cliques in 3‐uniform hypergraphs ⋮ Constructions for optimal cyclic ternary constant-weight codes of weight four and distance six ⋮ The completion determination of optimal \((3,4)\)-packings ⋮ Maximal resolvable packings and minimal resolvable coverings of triples by quadruples ⋮ Suitable sets of permutations, packings of triples, and Ramsey's theorem ⋮ List decodability at small radii ⋮ An improvement on H design ⋮ Two-weight codes: upper bounds and new optimal constructions ⋮ On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Candelabra systems and designs
• A class of three-designs
• The last packing number of quadruples, and cyclic SQS
• The fundamental construction for 3-designs
• Upper bounds for constant weight error correcting codes
• A new table of constant weight codes
• On Quadruple Systems