Covering radius and the chromatic number of Kneser graphs
Let C be a binary linear code with covering radius R and let C0 be a subcode of C with codimension i. We prove that the covering radius R0 of C satisfies R0 ≤ 2R + 2i - 1, by setting up a graph coloring problem involving Kneser graphs. © 1990.
Volume / Issue
Start / End Page
Electronic International Standard Serial Number (EISSN)
International Standard Serial Number (ISSN)
Digital Object Identifier (DOI)