Naslov
Elusive codes in Hamming graphs

Autori
Hawtin, Daniel ; Gillespie, Neil ; Praeger, Cherly

Izvornik
Bulletin of the Australian Mathematical Society (0004-9727) 88 (2013); 286-296

Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni

Ključne riječi
elusive codes ; Hamming graph

Sažetak
We consider a code to be a subset of the vertex set of a Hamming graph. We examine elusive pairs, code-group pairs where the code is not determined by knowledge of its set of neighbours. We construct a new infinite family of elusive pairs, where the group in question acts transitively on the set of neighbours of the code. In our examples, we find that the alphabet size always divides the length of the code, and prove that there is no elusive pair for the smallest set of parameters for which this is not the case. We also pose several questions regarding elusive pairs.

Izvorni jezik
Engleski

Znanstvena područja
Matematika

POVEZANOST RADA