A lower bound on permutation codes of distance n-1

DOI10.1007/S10623-019-00670-5MaRDI QIDQ2285776zbMATH OpenOpenAlexFDO

Authors Sergey Bereg, Peter 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

Buchstab sieveidempotent Latin squarespermutation codes

Mathematics Subject Classification ID

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

Abstract: A classical recursive construction for mutually orthogonal latin squares (MOLS) is shown to hold more generally for a class of permutation codes of length $n$ and minimum distance $n-1$. When such codes of length $p+1$ are included as ingredients, we obtain a general lower bound $M(n,n-1)ge{n}^{1.079}$ for large $n$, gaining a small improvement on the guarantee given from MOLS.

Recommendations

• Bounds of multipermutation codes in the generalized Cayley distance
• Bounds on permutation codes of distance four
• Proof of a conjecture of Kløve on permutation codes under the Chebychev distance
• On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices
• Bounds on the Size of Permutation Codes With the Kendall <inline-formula> <tex-math notation="LaTeX">$\tau $ </tex-math></inline-formula>-Metric
• An Improvement on the Gilbert–Varshamov Bound for Permutation Codes
• On the minimum distance of combinatorial codes
• Upper bounds on permutation codes via linear programming
• New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric

Cites work

• A bound on permutation codes
• A new table of permutation codes
• Bounds for permutation arrays
• Concerning the number of mutually orthogonal latin squares
• Constructions for permutation codes in powerline communications
• Constructions of permutation arrays
• Eine Bemerkung zur Abschätzung der Anzahl orthogonaler lateinischer Quadrate mittels Siebverfahren
• Existence of Five MOLS of Orders 18 and 60
• Extending permutation arrays: improving MOLS bounds
• scientific article; zbMATH DE number 3695314 (Why is no real title available?)
• scientific article; zbMATH DE number 898422 (Why is no real title available?)
• Isometry invariant permutation codes and mutually orthogonal Latin squares
• On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order
• On the maximum number of permutations with given maximal or minimal distance
• Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
• Permutation codes invariant under isometries
• Powerline communication and the 36 officers problem

Cited in

(6)

• Bounds on permutation codes of distance four
• A note on good permutation codes from Reed-Solomon codes
• Twisted permutation codes
• A bound on permutation codes
• Isometry invariant permutation codes and mutually orthogonal Latin squares
• Intersection density of imprimitive groups of degree \(pq\)

This page was built for publication: A lower bound on permutation codes of distance \(n-1\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2285776)