Constructions of permutation arrays

DOI10.1109/18.992812zbMath1061.05016OpenAlexW2099775895MaRDI QIDQ4674484

Torleiv Kløve, Victor K. Wei, Fang-Wei Fu, Cunsheng Ding

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)

Related Items (10)

Complete weight enumerators of some linear codes and their applications ⋮ New simple constructions of distance-increasing mappings from binary vectors to permutations ⋮ On the construction of permutation arrays via mappings from binary vectors to permutations ⋮ A random construction for permutation codes and the covering radius ⋮ A new metric on symmetric groups and applications to block permutation codes ⋮ New nonexistence results on perfect permutation codes under the Hamming metric ⋮ An image encryption scheme with a pseudorandom permutation based on chaotic maps ⋮ A lower bound on permutation codes of distance \(n-1\) ⋮ 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

This page was built for publication: Constructions of permutation arrays