About non equivalent completely regular codes with identical intersection array

J. Rifà, V. A. Zinoviev

Research output: Contribution to journalArticleResearchpeer-review

Abstract

© 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.
Original languageEnglish
Pages (from-to)181-186
JournalElectronic Notes in Discrete Mathematics
Volume57
DOIs
Publication statusPublished - 1 Mar 2017

Keywords

  • Completely regular codes
  • coset graphs
  • distance regular graphs

Fingerprint Dive into the research topics of 'About non equivalent completely regular codes with identical intersection array'. Together they form a unique fingerprint.

Cite this