A lower bound on permutation codes of distance n-1

DOI10.1007/S10623-019-00670-5zbMATH Open1428.05003arXiv1902.04153OpenAlexW2969249270MaRDI QIDQ2285776FDOQ2285776

Authors: Sergey Bereg, Peter Dukes 

Publication date: 9 January 2020

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

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.

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

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

zbMATH Keywords

permutation codesBuchstab sieveidempotent Latin squares

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

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

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)