Distance colorings of hypercubes from Z₂ Z₄-linear codes
From MaRDI portal
Publication:516839
Recommendations
Cites work
- $\BBZ_{2}\BBZ_{4}$ -Additive Cyclic Codes
- \(\mathbb Z_2\mathbb Z_4\)-linear codes: Generator matrices and duality
- A \(\mathbb Z_{4}\)-linear code of high minimum Lee distance derived from a hyperoval
- A coloring problem on the \(n\)-cube
- BCH codes and distance multi- or fractional colorings in hypercubes asymptotically
- Construction of a \((64,2^{37},12)\) code via Galois rings
- Cyclic codes over Z/sub 4/, locator polynomials, and Newton's identities
- scientific article; zbMATH DE number 1775058 (Why is no real title available?)
- Maximum distance separable codes over \({\mathbb{Z}_4}\) and \({\mathbb{Z}_2 \times \mathbb{Z}_4}\)
- Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
- New bounds on a hypercube coloring problem.
- New results on two hypercube coloring problems
- New ring-linear codes from dualization in projective Hjelmslev geometries
- On a hypercube coloring problem
- Some maximum multigraphs and adge/vertex distance colourings
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
This page was built for publication: Distance colorings of hypercubes from \(\mathbb{Z}_2 \mathbb{Z}_4\)-linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q516839)