Neighbour transitivity on codes in Hamming graphs

Neil Gillespie; Cheryl Praeger

doi:10.1007/s10623-012-9614-5

Neighbour transitivity on codes in Hamming graphs

Neil Gillespie, Cheryl Praeger

Research output: Contribution to journal › Article

10 Citations (Scopus)

Abstract

We consider a code to be a subset of the vertex set of a Hamming graph. In this setting a neighbour of the code is a vertex which differs in exactly one entry from some codeword. This paper examines codes with the property that some group of automorphisms acts transitively on the set of neighbours of the code. We call these codes neighbour transitive. We obtain sufficient conditions for a neighbour transitive group to fix the code setwise. Moreover, we construct an infinite family of neighbour transitive codes, with minimum distance δ = 4, where this is not the case. That is to say, knowledge of even the complete set of code neighbours does not determine the code. © 2012 Springer Science+Business Media, LLC.

Original language	English
Pages (from-to)	385-393
Journal	Designs Codes and Cryptography
Volume	67
Issue number	3
DOIs	https://doi.org/10.1007/s10623-012-9614-5
Publication status	Published - 2013

Access to Document

10.1007/s10623-012-9614-5

Fingerprint Dive into the research topics of 'Neighbour transitivity on codes in Hamming graphs'. Together they form a unique fingerprint.

Cite this

@article{fc592d921fdc4e20aa4d4d6791894e5f,

title = "Neighbour transitivity on codes in Hamming graphs",

abstract = "We consider a code to be a subset of the vertex set of a Hamming graph. In this setting a neighbour of the code is a vertex which differs in exactly one entry from some codeword. This paper examines codes with the property that some group of automorphisms acts transitively on the set of neighbours of the code. We call these codes neighbour transitive. We obtain sufficient conditions for a neighbour transitive group to fix the code setwise. Moreover, we construct an infinite family of neighbour transitive codes, with minimum distance δ = 4, where this is not the case. That is to say, knowledge of even the complete set of code neighbours does not determine the code. {\textcopyright} 2012 Springer Science+Business Media, LLC.",

author = "Neil Gillespie and Cheryl Praeger",

year = "2013",

doi = "10.1007/s10623-012-9614-5",

language = "English",

volume = "67",

pages = "385--393",

journal = "Designs Codes and Cryptography",

issn = "0925-1022",

publisher = "Springer",

number = "3",

}

TY - JOUR

T1 - Neighbour transitivity on codes in Hamming graphs

AU - Gillespie, Neil

AU - Praeger, Cheryl

PY - 2013

Y1 - 2013

N2 - We consider a code to be a subset of the vertex set of a Hamming graph. In this setting a neighbour of the code is a vertex which differs in exactly one entry from some codeword. This paper examines codes with the property that some group of automorphisms acts transitively on the set of neighbours of the code. We call these codes neighbour transitive. We obtain sufficient conditions for a neighbour transitive group to fix the code setwise. Moreover, we construct an infinite family of neighbour transitive codes, with minimum distance δ = 4, where this is not the case. That is to say, knowledge of even the complete set of code neighbours does not determine the code. © 2012 Springer Science+Business Media, LLC.

AB - We consider a code to be a subset of the vertex set of a Hamming graph. In this setting a neighbour of the code is a vertex which differs in exactly one entry from some codeword. This paper examines codes with the property that some group of automorphisms acts transitively on the set of neighbours of the code. We call these codes neighbour transitive. We obtain sufficient conditions for a neighbour transitive group to fix the code setwise. Moreover, we construct an infinite family of neighbour transitive codes, with minimum distance δ = 4, where this is not the case. That is to say, knowledge of even the complete set of code neighbours does not determine the code. © 2012 Springer Science+Business Media, LLC.

U2 - 10.1007/s10623-012-9614-5

DO - 10.1007/s10623-012-9614-5

M3 - Article

VL - 67

SP - 385

EP - 393

JO - Designs Codes and Cryptography

JF - Designs Codes and Cryptography

SN - 0925-1022

IS - 3

ER -