Constructing permutation arrays using partition and extension

DOI10.1007/s10623-019-00684-zzbMath1480.05001arXiv1804.08252WikidataQ127061633 ScholiaQ127061633MaRDI QIDQ2291664

Luis Gerardo Mojica, Hal Sudborough, Sergey Bereg, Linda Morales

Publication date: 31 January 2020

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

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

zbMATH Keywords

Kronecker product; permutation arrays; coset method; partition and extension

Mathematics Subject Classification ID

05A18: Partitions of sets

90C10: Integer programming

90C05: Linear programming

05A05: Permutations, words, matrices

94B65: Bounds on codes

94B25: Combinatorial codes

Related Items

Using permutation rational functions to obtain permutation arrays with large Hamming distance, Improved lower bounds for permutation arrays using permutation rational functions, Constructing permutation arrays using partition and extension

Uses Software

• CPLEX
• Gurobi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extending permutation arrays: improving MOLS bounds
• A new table of permutation codes
• Bounds for permutation arrays
• New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
• Constructing permutation arrays from groups
• Eine Bemerkung zur Abschätzung der Anzahl orthogonaler lateinischer Quadrate mittels Siebverfahren
• Constructions for permutation codes in powerline communications
• Constructing permutation arrays using partition and extension
• 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
• On the history of the kronecker product
• The direct product permuting matrices
• Powerline communication and the 36 officers problem