A new table of permutation codes

DOI10.1007/s10623-011-9551-8zbMath1237.05008OpenAlexW1982382042MaRDI QIDQ766240

Derek H. Smith, Roberto Montemanni

Publication date: 23 March 2012

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: http://doc.rero.ch/record/319514/files/10623_2011_Article_9551.pdf

zbMATH Keywords

automorphism groupsclique searchpermutation codespermutation arrays

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Other types of codes (94B60)

Related Items (15)

Using permutation rational functions to obtain permutation arrays with large Hamming distance ⋮ The maximum clique problem for permutation Hamming graphs ⋮ Permutation codes with specified packing radius ⋮ A new metric on symmetric groups and applications to block permutation codes ⋮ New nonexistence results on perfect permutation codes under the Hamming metric ⋮ Multiple contractions of permutation arrays ⋮ Maximum independent sets and supervised learning ⋮ Constructing permutation arrays from groups ⋮ Extending permutation arrays: improving MOLS bounds ⋮ Decoding mixed errors and erasures in permutation codes ⋮ 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

Uses Software

• Magma
• Max-AO
• MaxCliqueDyn
• FASoft

Cites Work

• Unnamed Item
• Unnamed Item
• New upper bounds for the size of permutation codes via linear programming
• An exact algorithm for the maximum clique problem
• Error-correcting codes from permutation groups
• On the maximum number of permutations with given maximal or minimal distance
• Bounds for permutation arrays
• Upper bounds on permutation codes via linear programming
• Maximum stable set formulations and heuristics based on continuous optimization
• A fast algorithm for the maximum clique problem
• Constructions for permutation codes in powerline communications
• Bounds on permutation codes of distance four
• Constructing transitive permutation groups.
• Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
• Heuristic Algorithms for Constructing Binary Constant Weight Codes
• Permutation codes for discrete channels (Corresp.)
• Powerline communication and the 36 officers problem

This page was built for publication: A new table of permutation codes