Bounds for permutation arrays

DOI10.1016/0378-3758(78)90008-3MaRDI QIDQ1248524zbMATH OpenOpenAlexFDO

Authors Michel 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)

Cites work

• scientific article; zbMATH DE number 3747143 (Why is no real title available?)
• scientific article; zbMATH DE number 3760183 (Why is no real title available?)
• scientific article; zbMATH DE number 3525849 (Why is no real title available?)
• scientific article; zbMATH DE number 3545673 (Why is no real title available?)
• scientific article; zbMATH DE number 3572182 (Why is no real title available?)
• scientific article; zbMATH DE number 3575596 (Why is no real title available?)
• scientific article; zbMATH DE number 3583835 (Why is no real title available?)
• scientific article; zbMATH DE number 3613056 (Why is no real title available?)
• scientific article; zbMATH DE number 3319622 (Why is no real title available?)
• Coding with permutations
• Equidistant codes with distance 12
• 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
• Pairwise Orthogonal generalized room squares and equidistant permutation arrays
• The Asymptotic Behaviour of Equidistant Permutation Arrays
• The existence of Room squares

Cited in

(27)

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

This page was built for publication: Bounds for permutation arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1248524)