Diagonally neighbour transitive codes and frequency permutation arrays

DOI10.1007/S10801-013-0465-6MaRDI QIDQ2454089zbMATH OpenOpenAlexWikidataFDO

Authors Neil I. Gillespie, Cheryl E. Praeger

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

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

Abstract: Constant composition codes have been proposed as suitable coding schemes to solve the narrow band and impulse noise problems associated with powerline communication. In particular, a certain class of constant composition codes called frequency permutation arrays have been suggested as ideal, in some sense, for these purposes. In this paper we characterise a family of neighbour transitive codes in Hamming graphs in which frequency permutation arrays play a central rode. We also classify all the permutation codes generated by groups in this family.

Recommendations

• Equidistant frequency permutation arrays and related constant composition codes
• Neighbour-transitive codes and partial spreads in generalised quadrangles
• Transitive nonpropelinear perfect codes
• Codes associated with triangular graphs and permutation decoding
• Linear codes and doubly transitive symmetric designs
• Codes for almost block diagonal systems
• Binary codes from rectangular lattice graphs and permutation decoding
• Codes from lattice and related graphs, and permutation decoding
• On optimal permutation codes
• Reverse-free codes and permutations

Cites work

• scientific article; zbMATH DE number 3695090 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 1209696 (Why is no real title available?)
• A random construction for permutation codes and the covering radius
• Coding with injections
• Coding with permutations
• Completely regular codes
• Completely transitive codes in Hamming graphs
• Constructions for permutation codes in powerline communications
• Error-correcting codes from permutation groups
• Frequency permutation arrays
• Neighbour transitivity on codes in Hamming graphs
• On constant composition codes
• On the maximum number of permutations with given maximal or minimal distance
• Permutation codes for discrete channels (Corresp.)
• Permutation codes with specified packing radius

Cited in

(9)

• Neighbour-transitive codes and partial spreads in generalised quadrangles
• On the performance of permutation codes for multi-user communication
• Entry-faithful 2-neighbour transitive codes
• 2-neighbour-transitive codes with small blocks of imprimitivity
• Minimal binary 2-neighbour-transitive codes
• Equidistant frequency permutation arrays and related constant composition codes
• Frequency permutation arrays
• On the classification of binary completely transitive codes with almost-simple top-group
• Increasing the minimum distance of codes by twisting

This page was built for publication: Diagonally neighbour transitive codes and frequency permutation arrays

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