Multiple contractions of permutation arrays
From MaRDI portal
Publication:6083967
DOI10.1007/s10801-023-01238-2zbMath1525.05001arXiv2109.13585OpenAlexW3203042931MaRDI QIDQ6083967
Carmen Amarra, Dom Vito A. Briones, Manuel Joseph C. Loquias
Publication date: 31 October 2023
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.13585
Permutations, words, matrices (05A05) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Bounds on codes (94B65) Combinatorial codes (94B25)
Cites Work
- Unnamed Item
- Extending permutation arrays: improving MOLS bounds
- A new table of permutation codes
- Sharply 3-transitive groups.
- On the maximum number of permutations with given maximal or minimal distance
- Bounds for permutation arrays
- Constructing permutation arrays from groups
- Constructions for permutation codes in powerline communications
- Improved lower bounds for permutation arrays using permutation rational functions
- New lower bounds for permutation arrays using contraction
- Permutation codes invariant under isometries
- New Lower Bounds for Permutation Codes Using Linear Block Codes
This page was built for publication: Multiple contractions of permutation arrays