BCH codes and distance multi- or fractional colorings in hypercubes asymptotically
From MaRDI portal
Publication:868374
DOI10.1016/j.disc.2006.04.033zbMath1112.05040OpenAlexW2029496510MaRDI QIDQ868374
Publication date: 2 March 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.04.033
asymptoticsbounds on codeschromatic numberchromatic indexfractional chromaticbinary codedistance chromatic
Bounds on codes (94B65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Cyclic codes (94B15)
Related Items (3)
New results on two hypercube coloring problems ⋮ Distance colorings of hypercubes from \(\mathbb{Z}_2 \mathbb{Z}_4\)-linear codes ⋮ Two coloring problems on matrix graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a hypercube coloring problem
- On a generalized family of colorings
- The triply shortened binary Hamming code is optimal
- Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
- An enumerative algorithm for the frequency assignment problem
- A coloring problem on the \(n\)-cube
- Unit sphere packings and coverings of the Hamming space
- New bounds on a hypercube coloring problem.
- On the strong chromatic index of cyclic multigraphs
- Matroidal bijections between graphs
- Five-coloring planar maps
- On a class of error correcting binary group codes
- Further results on error correcting binary group codes
- On the number of information symbols in Bose-Chaudhuri codes
- A (<5)-Colour Theorem for Planar Graphs
- Frequency planning and ramifications of coloring
- Partial covers of graphs
- Some maximum multigraphs and adge/vertex distance colourings
- Long BCH codes are bad
- Fixed-parameter complexity of \(\lambda\)-labelings
This page was built for publication: BCH codes and distance multi- or fractional colorings in hypercubes asymptotically
