Neighbour transitivity on codes in Hamming graphs

DOI10.1007/S10623-012-9614-5zbMATH Open1296.94160arXiv1112.1244OpenAlexW2018380381WikidataQ56987502 ScholiaQ56987502MaRDI QIDQ1949232FDOQ1949232

Neil I. Gillespie, Cheryl E. Praeger

Publication date: 6 May 2013

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: We consider a emph{code} to be a subset of the vertex set of a emph{Hamming graph}. In this setting a emph{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 emph{set of neighbours} of the code. We call these codes emph{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 emph{minimum distance} $delta=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.

Full work available at URL: https://arxiv.org/abs/1112.1244

Recommendations

• Entry-faithful 2-neighbour transitive codes
• Alphabet-almost-simple 2-neighbour-transitive codes
• 2-neighbour-transitive codes with small blocks of imprimitivity
• Completely transitive codes in Hamming graphs
• Sporadic neighbour-transitive codes in Johnson graphs

zbMATH Keywords

error correcting codesHamming graphsneighbour transitive codes

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Linear codes (general theory) (94B05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Fundamentals of Error-Correcting Codes
• Title not available (Why is that?)
• Completely transitive codes in Hamming graphs
• Neighbour transitivity on codes in Hamming graphs
• Uniqueness of certain completely regular Hadamard codes
• On the nonexistence of completely transitive codes
• Nonexistence of completely transitive codes with error-correcting capability e<3
• Completely regular codes and completely transitive codes
• Title not available (Why is that?)

Cited In (10)

• Entry-faithful 2-neighbour transitive codes
• \(s\)-elusive codes in Hamming graphs
• Neighbour transitivity on codes in Hamming graphs
• Increasing the minimum distance of codes by twisting
• 2-neighbour-transitive codes with small blocks of imprimitivity
• Minimal binary 2-neighbour-transitive codes
• Diagonally neighbour transitive codes and frequency permutation arrays
• Neighbour-transitive codes and partial spreads in generalised quadrangles
• On the classification of binary completely transitive codes with almost-simple top-group
• Coordinate transitivity of a class of extended perfect codes and their SQS

This page was built for publication: Neighbour transitivity on codes in Hamming graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1949232)