On completely regular codes of covering radius 1 in the halved hypercubes
classification
🧮 math.CO
cs.DM
keywords
regularcompletelyhalvedpartitioncodesequitablepartitionsperfect
read the original abstract
We consider constructions of covering-radius-1 completely regular codes, or, equivalently, equitable 2-partitions (regular 2-partitions, perfect 2-colorings), of halved n-cubes. Keywords: completely regular code, equitable partition, regular partition, partition design, perfect coloring, halved hypercube.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.