Entry-faithful 2-neighbour transitive codes

DOI10.1007/s10623-015-0069-3zbMath1338.94112arXiv1412.7290OpenAlexW2029062209WikidataQ56987364 ScholiaQ56987364MaRDI QIDQ281316

Michael Giudici, Neil I. Gillespie, Cheryl E. Praeger, Daniel R. Hawtin

Publication date: 10 May 2016

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

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

zbMATH Keywords

Hamming graph2-neighbour transitive codesautomorphisms groupscompletely transitive codesregular codes

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Other types of codes (94B60) Group actions on combinatorial structures (05E18)

Related Items (5)

Neighbour-transitive codes and partial spreads in generalised quadrangles ⋮ Coordinate transitivity of a class of extended perfect codes and their SQS ⋮ \(s\)-elusive codes in Hamming graphs ⋮ 2-neighbour-transitive codes with small blocks of imprimitivity ⋮ On the classification of binary completely transitive codes with almost-simple top-group

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(q\)-ary linear completely regular codes with \(\rho=2\) and antipodal dual
• Completely regular codes and completely transitive codes
• A classification of the maximal subgroups of the finite alternating and symmetric groups
• Note on the Mathieu group \(M_{12}\)
• Completely regular codes
• Completely transitive codes in Hamming graphs
• Neighbour transitivity on codes in Hamming graphs
• Uniqueness of certain completely regular Hadamard codes
• New families of completely regular codes and their corresponding distance regular coset graphs
• Families of completely transitive codes and distance transitive graphs
• Diagonally neighbour transitive codes and frequency permutation arrays
• \(k\)-homogeneous groups
• The Inclusion Problem for Finite Primitive Permutation Groups
• Bounds for binary codes of length less than 25
• Combinatorial Designs
• On the nonexistence of completely transitive codes
• Nonexistence of completely transitive codes with error-correcting capability e<3
• A Combinatorial Problem
• On imprimitive rank 3 permutation groups

This page was built for publication: Entry-faithful 2-neighbour transitive codes