Bounds for permutation arrays

DOI10.1016/0378-3758(78)90008-3zbMath0384.05026OpenAlexW1974627484MaRDI QIDQ1248524

Michel Marie Deza, Scott A. Vanstone

Publication date: 1978

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0378-3758(78)90008-3

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Designs and configurations (05B99)

Related Items (26)

On generalized Howell designs with block size three ⋮ On the construction of permutation arrays via mappings from binary vectors to permutations ⋮ A construction of optimal constant composition codes ⋮ Sharp sets of permutations ⋮ The maximum clique problem for permutation Hamming graphs ⋮ Permutation codes with specified packing radius ⋮ Guest editorial: Special issue in honor of Scott A. Vanstone ⋮ A new metric on symmetric groups and applications to block permutation codes ⋮ New nonexistence results on perfect permutation codes under the Hamming metric ⋮ Frames and doubly resolvable group divisible designs with block size three and index two ⋮ Multiple contractions of permutation arrays ⋮ Finite field constructions of combinatorial arrays ⋮ Semidefinite programming for permutation codes ⋮ On existence of two classes of generalized Howell designs with block size three and index two ⋮ Extending permutation arrays: improving MOLS bounds ⋮ Coding with injections ⋮ Bounds on permutation codes of distance four ⋮ A lower bound on permutation codes of distance \(n-1\) ⋮ Maximal sets of permutations constructed from projective planes ⋮ Constructing permutation arrays using partition and extension ⋮ A new table of permutation codes ⋮ A note on good permutation codes from Reed-Solomon codes ⋮ New lower bounds for permutation arrays using contraction ⋮ Mutually orthogonal binary frequency squares ⋮ Equidistant permutation group codes ⋮ Permutation codes invariant under isometries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The existence of Room squares
• Matrices dont deux lignes quelconque coincident dans un nombre donne de positions communes
• On the maximum number of permutations with given maximal or minimal distance
• Equidistant codes with distance 12
• Pairwise Orthogonal generalized room squares and equidistant permutation arrays
• Coding with permutations
• The Asymptotic Behaviour of Equidistant Permutation Arrays

This page was built for publication: Bounds for permutation arrays