A binary code C is said to be completely regular if the weight distribution of any translate x + C depends only on the distance of x to C. Such codes are related to designs and distance regular graphs. Their covering radius is equal to their external distance. All perfect and uniformly packed codes
p-Regular Completions and Compactifications
β Scribed by D. C. Kent; G. D. Richardson
- Publisher
- John Wiley and Sons
- Year
- 1991
- Tongue
- English
- Weight
- 557 KB
- Volume
- 151
- Category
- Article
- ISSN
- 0025-584X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract For __k__β=β1 and __k__β=β2, we prove that the obvious necessary numerical conditions for packing __t__ pairwise edgeβdisjoint __k__βregular subgraphs of specified orders __m__~1~,__m__~2~,β¦ ,__m__~t~ in the complete graph of order __n__ are also sufficient. To do so, we present an edge
## Abstract A topological space is called __s__βregular if each closed connected set and a point outside it are separated by disjoint open sets. Similarly notion of complete __s__βregularity is introduced; basic properties of __s__βregular spaces and completely __s__βregular spaces are studied and