Permutation codes with specified packing radius
From MaRDI portal
Publication:356723
DOI10.1007/S10623-012-9623-4zbMATH Open1269.05002OpenAlexW1991492239MaRDI QIDQ356723FDOQ356723
Authors: Derek H. Smith, Roberto Montemanni 
Publication date: 26 July 2013
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: http://doc.rero.ch/record/322266/files/10623_2012_Article_9623.pdf
Recommendations
Permutations, words, matrices (05A05) Group actions on combinatorial structures (05E18) Other types of codes (94B60)
Cites Work
- Maximum stable set formulations and heuristics based on continuous optimization
- On the maximum number of permutations with given maximal or minimal distance
- A fast algorithm for the maximum clique problem
- Covering radius for sets of permutations
- Constructing transitive permutation groups.
- Title not available (Why is that?)
- Bounds for permutation arrays
- Constructions for permutation codes in powerline communications
- A new trust region technique for the maximum weight clique problem
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
- Powerline communication and the 36 officers problem
- An exact algorithm for the maximum clique problem
- Error-correcting codes from permutation groups
- Upper bounds on permutation codes via linear programming
- Bounds on permutation codes of distance four
- A survey on packing and covering problems in the Hamming permutation space
- On Transitive Permutation Groups
- Heuristic Algorithms for Constructing Binary Constant Weight Codes
- Permutation codes for discrete channels (Corresp.)
- New upper bounds for the size of permutation codes via linear programming
- A new table of permutation codes
Cited In (26)
- Coding with injections
- A random construction for permutation codes and the covering radius
- Proof of a conjecture of Kløve on permutation codes under the Chebychev distance
- Maximum independent sets and supervised learning
- Computing the ball size of frequency permutations under Chebyshev distance
- Remoteness of permutation codes
- Permutation Decoding of Systematic Codes
- Permutation codes over Sylow 2-subgroups \(\mathrm{Syl}_2(S_{2^n})\) of symmetric groups \(S_{2^n}\)
- An enumerative method for runlength-limited codes: permutation codes
- Decoding mixed errors and erasures in permutation codes
- On the performance of permutation codes for multi-user communication
- Using permutation rational functions to obtain permutation arrays with large Hamming distance
- Good permutation codes based on the shuffle-exchange network
- The packing radius of a poset block code
- Constructing permutation arrays using partition and extension
- A note on good permutation codes from Reed-Solomon codes
- Infinity-norm permutation covering codes from cyclic groups
- Nonexistence of perfect permutation codes under the $$\ell _{\infty }$$-metric
- Diagonally neighbour transitive codes and frequency permutation arrays
- Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric
- Semidefinite programming for permutation codes
- Twisted permutation codes
- A class of maximal permutation cliques
- A new table of permutation codes
- Spearman permutation distances and Shannon's distinguishability
- New nonexistence results on perfect permutation codes under the Hamming metric
Uses Software
This page was built for publication: Permutation codes with specified packing radius
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q356723)
