Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

ELUSIVE CODES IN HAMMING GRAPHS

From MaRDI portal
Publication:2865132
Jump to:navigation, search

DOI10.1017/S0004972713000051zbMath1283.94146arXiv1208.4455WikidataQ56987488 ScholiaQ56987488MaRDI QIDQ2865132

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

Publication date: 28 November 2013

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

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


zbMATH Keywords

automorphism groupspermutation codespowerline communicationneighbour transitive codeselusive codes


Mathematics Subject Classification ID

Other types of codes (94B60) Group actions on combinatorial structures (05E18)


Related Items (2)

On existence of perfect bitrades in Hamming graphs ⋮ \(s\)-elusive codes in Hamming graphs







This page was built for publication: ELUSIVE CODES IN HAMMING GRAPHS

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2865132&oldid=15806996"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 19:25.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki