On transitive partitions of an \(n\)-cube into codes
From MaRDI portal
Publication:734284
DOI10.1134/S0032946009010037zbMath1173.94462OpenAlexW2050231010MaRDI QIDQ734284
Publication date: 20 October 2009
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0032946009010037
Orthogonal arrays, Latin squares, Room squares (05B15) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Related Items
A Partition of the Hypercube into Maximally Nonparallel Hamming Codes, On transitive uniform partitions of \(F^n\) into binary Hamming codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On partitions of an \(n\)-cube into nonequivalent perfect codes
- A General Product Construction for Error Correcting Codes
- A Generalized Parity Function and Its Use in the Construction of Perfect Codes
- Well-Ordered Steiner Triple Systems and 1-Perfect Partitions of the n-cube
- On Perfect Codes and Tilings: Problems and Solutions
- Intersection matrices for partitions by binary perfect codes
- On binary 1-perfect additive codes: some structural properties
- A characterization of 1-perfect additive codes
- 1-perfect uniform and distance invariant partitions