© 2018 AIMS. We construct new families of completely regular codes by concatenation methods. By combining parity check matrices of cyclic Hamming codes, we obtain families of completely regular codes. In all cases, we compute the intersection array of these codes. As a result, we find some non-equivalent completely regular codes, over the same finite field, with the same parameters and intersection array. We also study when the extension of these codes gives completely regular codes. Some of these new codes are completely transitive.
|Journal||Advances in Mathematics of Communications|
|Publication status||Published - 1 Jan 2018|
- Completely regular codes
- Completely transitive codes
- Extended codes
- Intersection array