Neighbour transitivity on codes in Hamming graphs

Neil Gillespie, Cheryl Praeger

    Research output: Contribution to journalArticle

    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 languageEnglish
    Pages (from-to)385-393
    JournalDesigns Codes and Cryptography
    Volume67
    Issue number3
    DOIs
    Publication statusPublished - 2013

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

    Cite this