TY - JOUR
T1 - About non equivalent completely regular codes with identical intersection array
AU - Rifà, J.
AU - Zinoviev, V. A.
PY - 2017/3/1
Y1 - 2017/3/1
N2 - © 2017 Elsevier B.V. We obtain several classes of completely regular codes with different parameters, but identical intersection array. Given a prime power q and any two natural numbers a, b, we construct completely transitive codes over different fields with covering radius ρ=min{a,b} and identical intersection array, specifically, we construct one code over Fqr for each divisor r of a or b. As a corollary, for any prime power q, we show that distance regular bilinear forms graphs can be obtained as coset graphs from several completely regular codes with different parameters.
AB - © 2017 Elsevier B.V. We obtain several classes of completely regular codes with different parameters, but identical intersection array. Given a prime power q and any two natural numbers a, b, we construct completely transitive codes over different fields with covering radius ρ=min{a,b} and identical intersection array, specifically, we construct one code over Fqr for each divisor r of a or b. As a corollary, for any prime power q, we show that distance regular bilinear forms graphs can be obtained as coset graphs from several completely regular codes with different parameters.
KW - Completely regular codes
KW - coset graphs
KW - distance regular graphs
U2 - https://doi.org/10.1016/j.endm.2017.02.030
DO - https://doi.org/10.1016/j.endm.2017.02.030
M3 - Article
SN - 1571-0653
VL - 57
SP - 181
EP - 186
JO - Electronic Notes in Discrete Mathematics
JF - Electronic Notes in Discrete Mathematics
ER -