Covering radius and the chromatic number of Kneser graphs

DOI10.1016/0097-3165(90)90011-KzbMATH Open0729.05017OpenAlexW2119627333MaRDI QIDQ805622FDOQ805622

Authors: Robert Calderbank 

Publication date: 1990

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(90)90011-k

Recommendations

• On the covering radius of subcodes of a code
• Further results on the covering radius of codes
• On the covering radius of a code and its subcodes
• scientific article; zbMATH DE number 3965968
• Subcodes and covering radius (Corresp.)

zbMATH Keywords

graph coloringcovering radiusKneser graphsbinary linear codesubcode

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Linear codes (general theory) (94B05)

Cites Work

• Kneser's conjecture, chromatic number, and homotopy
• A short proof of Kneser's conjecture
• On the chromatic number of the general Kneser-graph
• Subcodes and covering radius (Corresp.)
• On the covering radius of a code and its subcodes

Cited In (2)

• Critical problem for codes over finite chain rings
• Intersection of Hamming codes avoiding Hamming subcodes

This page was built for publication: Covering radius and the chromatic number of Kneser graphs

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