A new table of permutation codes
From MaRDI portal
Publication:766240
Recommendations
- Constructions for permutation codes in powerline communications
- Constructing permutation arrays using partition and extension
- Permutation codes with specified packing radius
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
- Powerline communication and the 36 officers problem
Cites work
- A fast algorithm for the maximum clique problem
- An exact algorithm for the maximum clique problem
- An improved branch and bound algorithm for the maximum clique problem
- Bounds for permutation arrays
- Bounds on permutation codes of distance four
- Constructing transitive permutation groups.
- Constructions for permutation codes in powerline communications
- Error-correcting codes from permutation groups
- Heuristic Algorithms for Constructing Binary Constant Weight Codes
- scientific article; zbMATH DE number 1786225 (Why is no real title available?)
- Maximum stable set formulations and heuristics based on continuous optimization
- New upper bounds for the size of permutation codes via linear programming
- On the maximum number of permutations with given maximal or minimal distance
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
- Permutation codes for discrete channels (Corresp.)
- Powerline communication and the 36 officers problem
- Upper bounds on permutation codes via linear programming
Cited in
(25)- On some connections between permutations and coding
- Constructing permutation arrays from groups
- Using permutation rational functions to obtain permutation arrays with large Hamming distance
- The maximum clique problem for permutation Hamming graphs
- 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
- On the performance of permutation codes for multi-user communication
- New permutation codes using Hadamard unscrambling (Corresp.)
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
- Permutation codes with specified packing radius
- Optimal permutation codes for the Gaussian channel
- On optimal permutation codes
- Extending permutation arrays: improving MOLS bounds
- Powerline communication and the 36 officers problem
- A new metric on symmetric groups and applications to block permutation codes
- New nonexistence results on perfect permutation codes under the Hamming metric
- Good permutation codes based on the shuffle-exchange network
- Multiple contractions of permutation arrays
- Maximum independent sets and supervised learning
- Classes of permutation arrays in finite projective spaces
- Upper bounds on the size of permutation codes with a Hamming distance of five
This page was built for publication: A new table of permutation codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q766240)
