Extending permutation arrays: improving MOLS bounds

DOI10.1007/s10623-016-0263-yzbMath1359.05002OpenAlexW2496009344MaRDI QIDQ521869

Linda Morales, Sergey Bereg, Ivan Hal Sudborough

Publication date: 12 April 2017

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

Full work available at URL: https://doi.org/10.1007/s10623-016-0263-y

zbMATH Keywords

Hamming distanceerror correcting codespermutation arrays

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Other types of codes (94B60)

Related Items

Using permutation rational functions to obtain permutation arrays with large Hamming distance, Multiple contractions of permutation arrays, Improved lower bounds for permutation arrays using permutation rational functions, Constructing permutation arrays from groups, A lower bound on permutation codes of distance \(n-1\), 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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new nonexistence result for sharply multiply transitive permutation sets.
• A new table of permutation codes
• On the construction of permutation arrays via mappings from binary vectors to permutations
• On the maximum number of permutations with given maximal or minimal distance
• Bounds for permutation arrays
• Eine Bemerkung zur Abschätzung der Anzahl orthogonaler lateinischer Quadrate mittels Siebverfahren
• Constructions for permutation codes in powerline communications
• Permutation codes invariant under isometries
• An Improvement on the Gilbert–Varshamov Bound for Permutation Codes
• Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
• Powerline communication and the 36 officers problem