Increasing the minimum distance of codes by twisting

zbMath1408.94989arXiv1511.07154MaRDI QIDQ1671660

Marzieh Akbari, Cheryl E. Praeger, Neil I. Gillespie

Publication date: 7 September 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

constant composition codespermutation codesfrequency permutation arrayspowerline communicationtwisted permutation codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear algebraic groups over finite fields (20G40) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Combinatorial codes (94B25)

Related Items

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equidistant frequency permutation arrays and related constant composition codes
• Constructions for permutation codes in powerline communications
• Neighbour transitivity on codes in Hamming graphs
• Twisted permutation codes
• Diagonally neighbour transitive codes and frequency permutation arrays
• On constant composition codes
• Frequency permutation arrays
• Decoding Frequency Permutation Arrays Under Chebyshev Distance
• Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme