Constructions of permutation arrays

DOI10.1109/18.992812zbMATH Open1061.05016OpenAlexW2099775895MaRDI QIDQ4674484FDOQ4674484

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

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

Mathematics Subject Classification ID

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

Cited In (24)

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

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)