Completely regular codes with different parameters giving the same distance-regular coset graphs
| Autor: | Victor Zinoviev, J. Rif |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Divisor
Natural number 0102 computer and information sciences 02 engineering and technology Bilinear form 01 natural sciences Distance-regular graph Theoretical Computer Science Combinatorics Intersection Coset graph 0202 electrical engineering electronic engineering information engineering Lifting of a field Discrete Mathematics and Combinatorics Prime power Mathematics Discrete mathematics Completely regular code 020206 networking & telecommunications Distance-transitive graph Bilinear forms graph 010201 computation theory & mathematics Completely transitive code Uniformly packed code Coset Kronecker product construction |
| Zdroj: | Dipòsit Digital de Documents de la UAB Universitat Autònoma de Barcelona |
| ISSN: | 0012-365X |
| DOI: | 10.1016/j.disc.2017.03.001 |
| Popis: | We construct 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}ρ=min{a,b} and identical intersection array, specifically, one code over F_q^r for each divisor r of a or b. As a corollary, for any prime power qq, 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: |
|
Full Text from ScienceDirect