New completely regular q-ary codes based on Kronecker products

Simple item page
dc.creatorRifa, J.
dc.creatorZinoviev, V. A.
dc.date2008-10-28
dc.date.accessioned2026-07-07T10:13:37Z
dc.date.available2026-07-07T10:13:37Z
dc.descriptionFor any integer $ρ\geq 1$ 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.
dc.descriptionSubmitted 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.}}
dc.identifierhttps://arxiv.org/abs/0810.4993
dc.identifierhttp://arxiv.org/abs/0810.4993
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/172595
dc.subjectInformation Theory
dc.subjectDiscrete Mathematics
dc.subjectCombinatorics
dc.subject94B25
dc.titleNew completely regular q-ary codes based on Kronecker products
dc.typetext

Files

Collections

arXiv