Hypercube 1-factorizations from extended Hamming codes

DOI10.1016/J.ENDM.2009.07.106MaRDI QIDQ2851530zbMATH OpenOpenAlexWikidataFDO

Authors Petr Gregor

Publication date 10 October 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2009.07.106

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• 1-Perfect Codes Over Dual-Cubes vis-à-vis Hamming Codes Over Hypercubes
• Code-generating factorizations of an \(n\)-dimensional unit cube and of perfect binary codes
• A partition of the hypercube into maximally nonparallel Hamming codes
• Semi-perfect 1-factorizations of the hypercube
• scientific article; zbMATH DE number 1759416
• On the factorization of codes
• scientific article; zbMATH DE number 2114221
• An application of Hajós factorizations to variable-length codes
• Shortening Array Codes and the Perfect $1$-Factorization Conjecture
• scientific article; zbMATH DE number 1861636

Cites work

• Bounding the size of square-free subgraphs of the hypercube
• Equitable factorizations of Hamming shells
• scientific article; zbMATH DE number 3869331 (Why is no real title available?)
• On the maximum number of edges in a c₄‐free subgraph of q_n
• Polychromatic Colorings of Subcubes of the Hypercube
• Rainbows in the hypercube
• Turán’s Theorem in the Hypercube

Cited in

(4)

• Equitable factorizations of Hamming shells
• Distance colorings of hypercubes from \(\mathbb{Z}_2 \mathbb{Z}_4\)-linear codes
• Packing coloring of hypercubes with extended Hamming codes
• Highly symmetric subgraphs of hypercubes

This page was built for publication: Hypercube 1-factorizations from extended Hamming codes

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