A lower bound on permutation codes of distance \(n-1\)

DOI10.1007/s10623-019-00670-5zbMath1428.05003arXiv1902.04153OpenAlexW2969249270MaRDI QIDQ2285776

Sergey Bereg, Peter J. Dukes

Publication date: 9 January 2020

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

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

zbMATH Keywords

permutation codesBuchstab sieveidempotent Latin squares

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Permutations, words, matrices (05A05) Bounds on codes (94B65)

Cites Work

• A bound on permutation codes
• Extending permutation arrays: improving MOLS bounds
• A new table of permutation codes
• 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
• Concerning the number of mutually orthogonal latin squares
• Constructions for permutation codes in powerline communications
• Permutation codes invariant under isometries
• On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order
• Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
• Constructions of permutation arrays
• Isometry invariant permutation codes and mutually orthogonal Latin squares
• Existence of Five MOLS of Orders 18 and 60
• Powerline communication and the 36 officers problem
• Unnamed Item
• Unnamed Item