A lower bound on permutation codes of distance n-1

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 ) ≥ n 1...

Full description

Saved in:
Bibliographic Details
Published in:Designs, codes, and cryptography codes, and cryptography, 2020, Vol.88 (1), p.63-72
Main Authors: Bereg, Sergey, Dukes, Peter J.
Format: Article
Language:English
Subjects:
Arrays
Circuits
Codes
Coding and Information Theory
Computer Science
Cryptology
Data Structures and Information Theory
Discrete Mathematics in Computer Science
Information and Communication
Latin square design
Lower bounds
Permutations
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 ) ≥ n 1.0797 for large n , gaining a small improvement on the guarantee given from MOLS.
ISSN:0925-1022
1573-7586
DOI:10.1007/s10623-019-00670-5