About non equivalent completely regular codes with identical intersection array
| Autor: | Josep Rifà, Victor Zinoviev |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Discrete mathematics
Code (set theory) Divisor Applied Mathematics Coset graphs Distance regular graphs 020206 networking & telecommunications Natural number 0102 computer and information sciences 02 engineering and technology Bilinear form Completely regular codes 01 natural sciences Combinatorics Corollary Intersection 010201 computation theory & mathematics 0202 electrical engineering electronic engineering information engineering Discrete Mathematics and Combinatorics Coset Prime power Mathematics |
| Zdroj: | Recercat: Dipósit de la Recerca de Catalunya Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya) Recercat. Dipósit de la Recerca de Catalunya instname Dipòsit Digital de Documents de la UAB Universitat Autònoma de Barcelona |
| Popis: | 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 F q r 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|