BCH codes and distance multi- or fractional colorings in hypercubes asymptotically
type: Item
instance of: scholarly article
title: BCH codes and distance multi- or fractional colorings in hypercubes asymptotically
zbMATH Open document ID: 1112.05040
author: Zdzisław Skupień
published in: Discrete Mathematics
publication date: 2007-03-02T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 94B65
Mathematics Subject Classification ID: 94B15
zbMATH DE Number: 5130461
zbMATH Keywords: binary code
zbMATH Keywords: distance chromatic
zbMATH Keywords: fractional chromatic
zbMATH Keywords: chromatic number
zbMATH Keywords: chromatic index
zbMATH Keywords: bounds on codes
zbMATH Keywords: asymptotics
MaRDI profile type: Publication
full work available at URL: j.disc.2006.04.033
OpenAlex ID: W2029496510
cites work: On a generalized family of colorings
cites work: The triply shortened binary Hamming code is optimal
cites work: On a class of error correcting binary group codes
cites work: Further results on error correcting binary group codes
cites work: Q5656678
cites work: Frequency planning and ramifications of coloring
cites work: Fixed-parameter complexity of \(\lambda\)-labelings
cites work: Partial covers of graphs
cites work: On the strong chromatic index of cyclic multigraphs
cites work: Q4501762
cites work: A (<5)-Colour Theorem for Planar Graphs
cites work: Q3265111
cites work: Unit sphere packings and coverings of the Hamming space
cites work: A coloring problem on the \(n\)-cube
cites work: Q5552096
cites work: Q5532157
cites work: Long BCH codes are bad
cites work: Matroidal bijections between graphs
cites work: Q4004139
cites work: Q4146667
cites work: On the number of information symbols in Bose-Chaudhuri codes
cites work: An enumerative algorithm for the frequency assignment problem
cites work: Five-coloring planar maps
cites work: New bounds on a hypercube coloring problem.
cites work: On a hypercube coloring problem
cites work: Q4004140
cites work: Q4382863
cites work: Some maximum multigraphs and adge/vertex distance colourings
cites work: Q5601776
cites work: Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
DOI: 10.1016/J.DISC.2006.04.033
description: scientific article; zbMATH DE number 5130461