New Completely Regular $q$-ary Codes Based on Kronecker Products
Josep Rifà, Victor A. Zinoviev · IEEE Transactions on Information Theory · 2010
For any integer ¿ ¿ 1 and for any prime power q , an explicit construction of an infinite family of completely regular (and completely transitive) q-ary codes withd= 3 and with covering radius ¿ is given. The intersection array is also computed. Under the same conditions, the explicit construction of an infinite family of q-ary uniformly packed codes (in the wide sense) with covering radius ¿, which are not completely regular, is also given. In both constructions, the Kronecker product is the basic tool that has been used.