Well-Ordered Steiner Triple Systems and 1-Perfect Partitions of the n-cube

DOI10.1137/S0895480197330722zbMath0983.94048OpenAlexW2155983255MaRDI QIDQ4255806

Josep Rifà

Publication date: 27 June 1999

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480197330722

zbMATH Keywords

1-perfect partitionsSteiner triple systems1-perfect binary codesdistance-compatible actionSloops

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Other designs, configurations (05B30) Combinatorial codes (94B25)

Related Items (4)

On partitions of an \(n\)-cube into nonequivalent perfect codes ⋮ A Partition of the Hypercube into Maximally Nonparallel Hamming Codes ⋮ STS-graphs of perfect codes mod kernel ⋮ On transitive partitions of an \(n\)-cube into codes

This page was built for publication: Well-Ordered Steiner Triple Systems and 1-Perfect Partitions of the n-cube