Constructions of permutation arrays

DOI10.1109/18.992812MaRDI QIDQ4674484zbMATH OpenOpenAlexFDO

Authors Cunsheng Ding, Fangwei Fu, Torleiv Kløve, Victor K. Wei

Publication date 11 May 2005

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.992812

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial codes (94B25)

Recommendations

• Constructions for permutation codes in powerline communications
• Classes of permutation arrays in finite projective spaces
• Constructing permutation arrays from groups
• Constructing permutation arrays using partition and extension
• Constructions of permutation arrays for certain scheduling cost measures

Cited in

(24)

• On the construction of permutation arrays via mappings from binary vectors to permutations
• Multiple contractions of permutation arrays
• Two Constructions of Permutation Arrays
• Classes of permutation arrays in finite projective spaces
• scientific article; zbMATH DE number 6531818 (Why is no real title available?)
• Computing the ball size of frequency permutations under Chebyshev distance
• Improved Bounds for Permutation Arrays Under Chebyshev Distance
• A new metric on symmetric groups and applications to block permutation codes
• An image encryption scheme with a pseudorandom permutation based on chaotic maps
• Constructions of permutation arrays for certain scheduling cost measures
• Constructing permutation arrays from groups
• Coding with injections
• Constructions for retransmission permutation arrays
• An Analysis of Permutations in Arrays
• On the maximum number of permutations with given maximal or minimal distance
• A construction of product blocks with a fixed block size
• Complete weight enumerators of some linear codes and their applications
• A random construction for permutation codes and the covering radius
• New simple constructions of distance-increasing mappings from binary vectors to permutations
• scientific article; zbMATH DE number 125593 (Why is no real title available?)
• New nonexistence results on perfect permutation codes under the Hamming metric
• Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes
• Doubly resolvable canonical Kirkman packing designs and its applications
• A lower bound on permutation codes of distance \(n-1\)

This page was built for publication: Constructions of permutation arrays

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