BCH codes and distance multi- or fractional colorings in hypercubes asymptotically

DOI10.1016/J.DISC.2006.04.033zbMATH Open1112.05040OpenAlexW2029496510MaRDI QIDQ868374FDOQ868374

Authors: Zdzisław Skupień 

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

Recommendations

• BCH codes are good for distance multicolorings with radio frequencies in hypercubes asymptotically
• On a hypercube coloring problem
• Distance colorings of hypercubes from \(\mathbb{Z}_2 \mathbb{Z}_4\)-linear codes
• New results on two hypercube coloring problems
• New bounds on a hypercube coloring problem.

zbMATH Keywords

asymptoticschromatic numberbounds on codesbinary codechromatic indexdistance chromaticfractional chromatic

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Cyclic codes (94B15) Bounds on codes (94B65)

Cites Work

• Title not available (Why is that?)
• On a class of error correcting binary group codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Frequency planning and ramifications of coloring
• A coloring problem on the \(n\)-cube
• New bounds on a hypercube coloring problem.
• On a hypercube coloring problem
• A (<5)-Colour Theorem for Planar Graphs
• Fixed-parameter complexity of \(\lambda\)-labelings
• An enumerative algorithm for the frequency assignment problem
• Long BCH codes are bad
• Partial covers of graphs
• Matroidal bijections between graphs
• The triply shortened binary Hamming code is optimal
• Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
• Some maximum multigraphs and adge/vertex distance colourings
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the number of information symbols in Bose-Chaudhuri codes
• Unit sphere packings and coverings of the Hamming space
• On a generalized family of colorings
• Further results on error correcting binary group codes
• On the strong chromatic index of cyclic multigraphs
• Five-coloring planar maps
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Two coloring problems on matrix graphs
• New results on two hypercube coloring problems
• On a hypercube coloring problem
• BCH codes are good for distance multicolorings with radio frequencies in hypercubes asymptotically
• Distance colorings of hypercubes from \(\mathbb{Z}_2 \mathbb{Z}_4\)-linear codes

This page was built for publication: BCH codes and distance multi- or fractional colorings in hypercubes asymptotically

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