Diagonally neighbour transitive codes and frequency permutation arrays

DOI10.1007/S10801-013-0465-6zbMATH Open1355.94091arXiv1204.2900OpenAlexW3103213953WikidataQ56987477 ScholiaQ56987477MaRDI QIDQ2454089FDOQ2454089

Authors: Neil I. Gillespie, Cheryl E. Praeger 

Publication date: 12 June 2014

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

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.

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

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

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)

Cites Work

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

Cited In (9)

• Entry-faithful 2-neighbour transitive codes
• On the performance of permutation codes for multi-user communication
• Increasing the minimum distance of codes by twisting
• 2-neighbour-transitive codes with small blocks of imprimitivity
• Minimal binary 2-neighbour-transitive codes
• Neighbour-transitive codes and partial spreads in generalised quadrangles
• 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

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)