Optimal partitions for triples

DOI10.1016/0097-3165(92)90062-YzbMath0757.05011MaRDI QIDQ1185896

Tuvi Etzion

Publication date: 28 June 1992

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

zbMATH Keywords

Steiner triple systemsdisjoint optimal codesoptimal parititions for triplesweight codes

Mathematics Subject Classification ID

Partitions of sets (05A18) Triple systems (05B07) Combinatorial codes (94B25)

Related Items (4)

On the chromatic number, colorings, and codes of the Johnson graph ⋮ Optimal ternary constant-composition codes with weight four and distance three ⋮ Partitions of triples into optimal packings ⋮ Partition of triples of order \(6 k +5\) into \(6 k +3\) optimal packings and one packing of size \(8 k +4\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On large sets of disjoint Steiner triple systems. VI
• On large sets of disjoint Steiner triple systems. III
• A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
• Some packings with Steiner triple systems
• A theorem on the maximum number of disjoint Steiner triple systems
• Sylvester's problem of the 15 schoolgirls
• Some mappings of periodic groups
• Covering all triples on n marks by disjoint Steiner systems
• Symmetric quasigroups of odd order
• On the maximum number of disjoint Steiner triple systems
• A new table of constant weight codes
• On Quadruple Systems
• New lower bounds for constant weight codes
• One-factorizations of the complete graph—A survey
• Maximal consistent families of triples

This page was built for publication: Optimal partitions for triples