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. We also study when the extension of these codes gives completely regular codes. Some of these new codes are completely transitive.
Download