A partition of the hypercube into maximally nonparallel Hamming codes

DOI10.1002/JCD.21363MaRDI QIDQ5414318zbMATH OpenOpenAlexFDO

Authors 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

1-perfect partitioncrooked permutationgold functionperfect code

Mathematics Subject Classification ID

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

Abstract: By using the Gold map, we construct a partition of the hypercube into cosets of Hamming codes such that for every two cosets the corresponding Hamming codes are maximally nonparallel, that is, their intersection cardinality is as small as possible to admit nonintersecting cosets.

Recommendations

• Partitions of F^n into non-parallel Hamming codes
• scientific article; zbMATH DE number 1882354
• On partitions of an n-cube into perfect binary codes
• On partitions of an n-cube into nonequivalent perfect codes
• On transitive uniform partitions of \(F^n\) into binary Hamming codes

Cites work

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

Cited in

(9)

• Gold codes, Hadamard partitions and the security of CDMA systems
• Small weight bases for Hamming codes
• Partitions of F^n into non-parallel Hamming codes
• On transitive uniform partitions of \(F^n\) into binary Hamming codes
• Hypercube 1-factorizations from extended Hamming codes
• scientific article; zbMATH DE number 1882354 (Why is no real title available?)
• On partitions of an n-cube into perfect binary codes
• scientific article; zbMATH DE number 7656038 (Why is no real title available?)
• Small weight bases for hamming codes

Describes a project that uses

Uses Software

• GAP
• LOOPS

This page was built for publication: A partition of the hypercube into maximally nonparallel Hamming codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5414318)