Diagonally neighbour transitive codes and frequency permutation arrays

DOI10.1007/s10801-013-0465-6zbMath1355.94091arXiv1204.2900OpenAlexW3103213953WikidataQ56987477 ScholiaQ56987477MaRDI QIDQ2454089

Cheryl E. Praeger, Neil I. Gillespie

Publication date: 12 June 2014

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

automorphism groupsconstant composition codespermutation codesfrequency permutation arrayspowerline communicationneighbour transitive codes

Mathematics Subject Classification ID

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

Related Items

Entry-faithful 2-neighbour transitive codes, Increasing the minimum distance of codes by twisting, Neighbour-transitive codes and partial spreads in generalised quadrangles, 2-neighbour-transitive codes with small blocks of imprimitivity, Minimal binary 2-neighbour-transitive codes, On the classification of binary completely transitive codes with almost-simple top-group

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Permutation codes with specified packing radius
• Coding with injections
• A random construction for permutation codes and the covering radius
• Error-correcting codes from permutation groups
• Completely regular codes
• On the maximum number of permutations with given maximal or minimal distance
• Completely transitive codes in Hamming graphs
• Constructions for permutation codes in powerline communications
• Neighbour transitivity on codes in Hamming graphs
• On constant composition codes
• Coding with permutations
• Frequency permutation arrays
• Permutation codes for discrete channels (Corresp.)