completely regular codes

This dataset is devoted to 1-perfect codes. Currently, it is mainly focused on the concatenated ternary perfect codes, but there is also an additional content, see (3+) below, (1-2) This dataset contains all inequivalent concatenated ternary 1-perfect codes of length 13. Additionally, it contains some components necessary to obtain such concatenated codes, namely, collections of disjoint ternary distance-3 Reed-Muller-like codes of length 9, see p.(1) below.