Constructing permutation arrays from groups

DOI10.1007/s10623-017-0381-1zbMath1396.05003arXiv1511.04494OpenAlexW2963221477MaRDI QIDQ1744019

Avi Levy, Sergey Bereg, Ivan Hal Sudborough

Publication date: 16 April 2018

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

groupsfinite fieldspermutation codespermutation arrays

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial codes (94B25) Group actions on combinatorial structures (05E18)

Related Items

Tests and proofs for custom data generators, Using permutation rational functions to obtain permutation arrays with large Hamming distance, The maximum clique problem for permutation Hamming graphs, Multiple contractions of permutation arrays, Improved lower bounds for permutation arrays using permutation rational functions, Constructing permutation arrays using partition and extension, A note on good permutation codes from Reed-Solomon codes, New lower bounds for permutation arrays using contraction

Cites Work

• Extending permutation arrays: improving MOLS bounds
• A new table of permutation codes
• On the maximum number of permutations with given maximal or minimal distance
• Constructions for permutation codes in powerline communications
• Permutation codes invariant under isometries
• An Improvement on the Gilbert–Varshamov Bound for Permutation Codes
• Coding with permutations
• Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
• Powerline communication and the 36 officers problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item