Distance colorings of hypercubes from \(\mathbb{Z}_2 \mathbb{Z}_4\)-linear codes

DOI10.1016/j.dam.2016.09.001zbMath1358.05113OpenAlexW2523039475MaRDI QIDQ516839

Gretchen L. Matthews

Publication date: 15 March 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.09.001

zbMATH Keywords

hypercubelinear codecodes over ringsgray mapdistance coloring

Mathematics Subject Classification ID

Hypergraphs (05C65) Linear codes (general theory) (94B05) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Uses Software

• Code Tables

Cites Work

• Unnamed Item
• Maximum distance separable codes over \({\mathbb{Z}_4}\) and \({\mathbb{Z}_2 \times \mathbb{Z}_4}\)
• Construction of a \((64,2^{37},12)\) code via Galois rings
• On a hypercube coloring problem
• \(\mathbb Z_2\mathbb Z_4\)-linear codes: Generator matrices and duality
• BCH codes and distance multi- or fractional colorings in hypercubes asymptotically
• Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
• A coloring problem on the \(n\)-cube
• New bounds on a hypercube coloring problem.
• New ring-linear codes from dualization in projective Hjelmslev geometries
• A \(\mathbb Z_{4}\)-linear code of high minimum Lee distance derived from a hyperoval
• New results on two hypercube coloring problems
• $\BBZ_{2}\BBZ_{4}$ -Additive Cyclic Codes
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Some maximum multigraphs and adge/vertex distance colourings
• Cyclic codes over Z/sub 4/, locator polynomials, and Newton's identities

This page was built for publication: Distance colorings of hypercubes from \(\mathbb{Z}_2 \mathbb{Z}_4\)-linear codes