Partitions of triples into optimal packings
From MaRDI portal
Publication:1185904
DOI10.1016/0097-3165(92)90069-7zbMath0757.05012OpenAlexW2015634066MaRDI QIDQ1185904
Publication date: 28 June 1992
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(92)90069-7
Partitions of sets (05A18) Triple systems (05B07) Combinatorial aspects of packing and covering (05B40)
Related Items (5)
On the chromatic number, colorings, and codes of the Johnson graph ⋮ Optimal ternary constant-composition codes with weight four and distance three ⋮ Partition of triples of order \(6 k +5\) into \(6 k +3\) optimal packings and one packing of size \(8 k +4\) ⋮ Novel space shift keying MIMO technique based on a Steiner triple system ⋮ A new existence proof for large sets of disjoint Steiner triple systems
Cites Work
- 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
- Optimal partitions for triples
- 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
- A new table of constant weight codes
- New lower bounds for constant weight codes
- Construction of Large Sets of Almost Disjoint Steiner Triple Systems
- Maximal consistent families of triples
This page was built for publication: Partitions of triples into optimal packings