A Partition of the Hypercube into Maximally Nonparallel Hamming Codes

DOI10.1002/jcd.21363zbMath1286.05114arXiv1210.0010OpenAlexW1484583065MaRDI QIDQ5414318

Denis S. Krotov

Publication date: 2 May 2014

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.0010

zbMATH Keywords

perfect codegold function1-perfect partitioncrooked permutation

Mathematics Subject Classification ID

Hypergraphs (05C65) Linear codes (general theory) (94B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Unnamed Item ⋮ On transitive uniform partitions of \(F^n\) into binary Hamming codes

Uses Software

• GAP
• LOOPS

Cites Work

• Unnamed Item
• On transitive partitions of an \(n\)-cube into codes
• On partitions of an \(n\)-cube into nonequivalent perfect codes
• Codes, bent functions and permutations suitable for DES-like cryptosystems
• Crooked functions, bent functions, and distance regular graphs
• Codes, graphs, and schemes from nonlinear functions
• Partitions of \(\mathbb F^n\) into non-parallel Hamming codes
• Binary perfect codes of length 15 by the generalized concatenated construction
• A General Product Construction for Error Correcting Codes
• A Combinatorial Construction of Perfect Codes
• A new construction of group and nongroup perfect codes
• Well-Ordered Steiner Triple Systems and 1-Perfect Partitions of the n-cube
• The automorphism group of double-error-correcting BCH codes
• On Perfect Codes and Tilings: Problems and Solutions
• Intersection matrices for partitions by binary perfect codes
• The Perfect Binary One-Error-Correcting Codes of Length <formula formulatype="inline"><tex Notation="TeX">$15$</tex></formula>: Part I—Classification
• 1-perfect uniform and distance invariant partitions

This page was built for publication: A Partition of the Hypercube into Maximally Nonparallel Hamming Codes