Pages that link to "Item:Q4680074"
From MaRDI portal
The following pages link to Distance-preserving mappings from binary vectors to permutations (Q4680074):
Displaying 10 items.
- Computing the ball size of frequency permutations under Chebyshev distance (Q417597) (← links)
- Decoding permutation arrays with ternary vectors (Q634128) (← links)
- Permutation sequences and coded PAM signals with spectral nulls at rational submultiples of the symbol frequency (Q662171) (← links)
- New simple constructions of distance-increasing mappings from binary vectors to permutations (Q845836) (← links)
- On the construction of permutation arrays via mappings from binary vectors to permutations (Q851743) (← links)
- Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes (Q1009036) (← links)
- The \(r\)-Hamming gap and distance-gap-preserving mappings from binary vectors to permutations (Q2284314) (← links)
- New algorithms of distance-increasing mappings from binary vectors to permutations by swaps (Q2491311) (← links)
- On constant composition codes (Q2492193) (← links)
- Modified linear block code with code rate 1/2 and less than 1/2 (Q5030505) (← links)
