On partitions of an \(n\)-cube into nonequivalent perfect codes
From MaRDI portal
Publication:941881
DOI10.1134/S0032946007040047zbMath1213.94166OpenAlexW1999687231MaRDI QIDQ941881
Olof Heden, Faina I. Solov'eva, Sergei V. Avgustinovich
Publication date: 2 September 2008
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0032946007040047
Related Items
Maximum intersection of linear codes and codes equivalent to linear ⋮ Unnamed Item ⋮ A Partition of the Hypercube into Maximally Nonparallel Hamming Codes ⋮ On transitive partitions of an \(n\)-cube into codes
Cites Work
- Unnamed Item
- Unnamed Item
- A General Product Construction for Error Correcting 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
- 1-perfect uniform and distance invariant partitions
