Hostname: page-component-7b7567c8c-2jgqx Total loading time: 0 Render date: 2026-11-19T13:30:12.922Z Has data issue: false hasContentIssue false

ELUSIVE CODES IN HAMMING GRAPHS

Published online by Cambridge University Press:  28 February 2013

DANIEL R. HAWTIN*
Affiliation:
The University of Western Australia, 35 Stirling Highway, Crawley, WA 6009, Australia email neil.gillespie@uwa.edu.aucheryl.praeger@uwa.edu.au
NEIL I. GILLESPIE
Affiliation:
The University of Western Australia, 35 Stirling Highway, Crawley, WA 6009, Australia email neil.gillespie@uwa.edu.aucheryl.praeger@uwa.edu.au
CHERYL E. PRAEGER
Affiliation:
The University of Western Australia, 35 Stirling Highway, Crawley, WA 6009, Australia email neil.gillespie@uwa.edu.aucheryl.praeger@uwa.edu.auAlso affiliated with King Abdulaziz University, Jeddah, Saudi Arabia email cheryl.praeger@uwa.edu.au
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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 these examples, the alphabet size always divides the length of the code. We show that there is no elusive pair for the smallest set of parameters that does not satisfy this condition. We also pose several questions regarding elusive pairs.

Information

Type
Research Article
Copyright
Copyright ©2013 Australian Mathematical Publishing Association Inc.