Distance-increasing mappings from binary vectors to permutations
From MaRDI portal
Recommendations
- Distance-preserving mappings from binary vectors to permutations
- New algorithms of distance-increasing mappings from binary vectors to permutations by swaps
- Distance-increasing mappings from binary vectors to permutations that increase hamming distances by at least two
- Distance-increasing maps of all lengths by simple mapping algorithms
- New simple constructions of distance-increasing mappings from binary vectors to permutations
Cited in
(15)- The \(r\)-Hamming gap and distance-gap-preserving mappings from binary vectors to permutations
- New algorithms of distance-increasing mappings from binary vectors to permutations by swaps
- Constructing constant composition codes via distance-increasing mappings
- Distance-increasing mappings from binary vectors to permutations that increase hamming distances by at least two
- New Distance-Preserving Maps of Odd Length
- Cyclic Constructions of Distance-Preserving Maps
- Distance-increasing maps of all lengths by simple mapping algorithms
- A Generalized Upper Bound and a Multilevel Construction for Distance-Preserving Mappings
- Simple Distance-Preserving Mappings From Ternary Vectors to Permutations
- Distance-Preserving and Distance-Increasing Mappings From Ternary Vectors to Permutations
- Distance-preserving mappings from binary vectors to permutations
- Modified linear block code with code rate 1/2 and less than 1/2
- Permutation sequences and coded PAM signals with spectral nulls at rational submultiples of the symbol frequency
- 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
This page was built for publication: Distance-increasing 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 Q3546669)