Families of nested completely regular codes and distance-regular graphs
2015
In this paper infinite families of linear binary nested completely
regular codes are constructed. They have covering radius $\rho$
equal to $3$ or $4,$ and are $1/2^i$th parts, for
$i\in\{1,\ldots,u\}$ of binary (respectively, extended binary)
Hamming codes of length $n=2^m-1$ (respectively, $2^m$), where
$m=2u$. In the usual way, i.e., as coset graphs, infinite families
of embedded distance-regular coset graphs of diameter $D$ equal
to $3$ or $4$ are constructed. This gives antipodal covers of some
distance-regular and distance-transitive graphs. In some cases, the constructed codes are
also completely transitive and the corresponding coset
graphs are distance-transitive.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
14
References
6
Citations
NaN
KQI