Bounds for permutation arrays

DOI10.1016/0378-3758(78)90008-3zbMath0384.05026MaRDI 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

05-02: Research exposition (monographs, survey articles) pertaining to combinatorics

05B99: Designs and configurations

Related Items

On generalized Howell designs with block size three, Permutation codes with specified packing radius, Extending permutation arrays: improving MOLS bounds, Coding with injections, A new table of permutation codes, On the construction of permutation arrays via mappings from binary vectors to permutations, A construction of optimal constant composition codes, Guest editorial: Special issue in honor of Scott A. Vanstone, Finite field constructions of combinatorial arrays, Sharp sets of permutations, Maximal sets of permutations constructed from projective planes, Bounds on permutation codes of distance four, A lower bound on permutation codes of distance \(n-1\), Constructing permutation arrays using partition and extension, A note on good permutation codes from Reed-Solomon codes, New lower bounds for permutation arrays using contraction, Permutation codes invariant under isometries, Semidefinite programming for permutation codes

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