On the construction of permutation arrays via mappings from binary vectors to permutations
From MaRDI portal
(Redirected from Publication:851743)
Recommendations
- Distance-preserving mappings from binary vectors to permutations
- Distance-increasing mappings from binary vectors to permutations
- Distance-Preserving and Distance-Increasing Mappings From Ternary Vectors to Permutations
- Simple Distance-Preserving Mappings From Ternary Vectors to Permutations
- New algorithms of distance-increasing mappings from binary vectors to permutations by swaps
Cites work
- Bounds for permutation arrays
- Constructions of permutation arrays
- Distance-increasing mappings from binary vectors to permutations
- Distance-preserving mappings from binary vectors to permutations
- New Distance-Preserving Maps of Odd Length
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
- Two Constructions of Permutation Arrays
- Upper bounds on permutation codes via linear programming
Cited in
(6)- New algorithms of distance-increasing mappings from binary vectors to permutations by swaps
- Two Constructions of Permutation Arrays
- Distance-increasing mappings from binary vectors to permutations that increase hamming distances by at least two
- Distance-Preserving and Distance-Increasing Mappings From Ternary Vectors to Permutations
- Extending permutation arrays: improving MOLS bounds
- Multiple contractions of permutation arrays
This page was built for publication: On the construction of permutation arrays via mappings from binary vectors to permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q851743)
