New completely regular q-ary codes based on Kronecker products
Information Theory
2008-10-29 v1 Discrete Mathematics
Combinatorics
math.IT
Abstract
For any integer and for any prime power q, the explicit construction of a infinite family of completely regular (and completely transitive) q-ary codes with d=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.
Keywords
Cite
@article{arxiv.0810.4993,
title = {New completely regular q-ary codes based on Kronecker products},
author = {J. Rifa and V. A. Zinoviev},
journal= {arXiv preprint arXiv:0810.4993},
year = {2008}
}
Comments
Submitted to IT-IEEE. Theorem 1 in Section III was presented at the 2nd International Castle Meeting on Coding Theory and Applications (2ICMCTA), Medina del Campo, Spain, September 2008.}}