Pregled bibliografske jedinice broj: 1175539
2-Neighbour-Transitive Codes with Small Blocks of Imprimitivity
2-Neighbour-Transitive Codes with Small Blocks of Imprimitivity // The Electronic journal of combinatorics, 27 (2020), 1; 1-16 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 1175539 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
2-Neighbour-Transitive Codes with Small Blocks of
Imprimitivity
Autori
Gillespie, Neil ; Hawtin, Daniel ; Praeger, Cherly
Izvornik
The Electronic journal of combinatorics (1077-8926) 27
(2020), 1;
1-16
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
Regular codes ; 2-Neighbour transitive codes
Sažetak
A code C in the Hamming graph Γ = H(m, q) is 2-neighbour-transitive if Aut(C) acts transitively on each of C = C0, C1 and C2, the first three parts of the distance parti- tion of V Γ with respect to C. Previous classifications of families of 2-neighbour-transitive codes leave only those with an affine action on the alphabet to be investigated. Here, 2- neighbour-transitive codes with minimum distance at least 5 and that contain “small” sub- codes as blocks of imprimitivity are classified. When considering codes with minimum distance at least 5, completely transitive codes are a proper subclass of 2-neighbour- transitive codes. Thus, as a corollary of the main result, completely transitive codes sat- isfying the above conditions are also classified.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Ustanove:
Sveučilište u Rijeci, Fakultet za matematiku
Profili:
Daniel Robert Hawtin
(autor)
Citiraj ovu publikaciju:
Časopis indeksira:
- Current Contents Connect (CCC)
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
