Extending permutation arrays: improving MOLS bounds

DOI10.1007/S10623-016-0263-YMaRDI QIDQ521869zbMATH OpenOpenAlexFDO

Authors Sergey Bereg, Linda Morales, I. H. 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

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

Recommendations

• Improved lower bounds for permutation arrays using permutation rational functions
• New lower bounds for permutation arrays using contraction
• A combinatorial theory of higher-dimensional permutation arrays
• Improved bounds for geometric permutations
• On the construction of permutation arrays via mappings from binary vectors to permutations
• An improved affine equivalence algorithm for random permutations
• Covering arrays of higher strength from permutation vectors
• Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation
• On the extension problem for partial permutations
• On convergence and extensions of size-biased permutations

Cites work

• scientific article; zbMATH DE number 706263 (Why is no real title available?)
• scientific article; zbMATH DE number 3286093 (Why is no real title available?)
• A new nonexistence result for sharply multiply transitive permutation sets.
• A new table of permutation codes
• An Improvement on the Gilbert–Varshamov Bound for Permutation Codes
• Bounds for permutation arrays
• Constructions for permutation codes in powerline communications
• Eine Bemerkung zur Abschätzung der Anzahl orthogonaler lateinischer Quadrate mittels Siebverfahren
• 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
• Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
• Permutation codes invariant under isometries
• Powerline communication and the 36 officers problem
• The CRC handbook of combinatorial designs

Cited in

(8)

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

This page was built for publication: Extending permutation arrays: improving MOLS bounds

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