Pages that link to "Item:Q356723"
From MaRDI portal
The following pages link to Permutation codes with specified packing radius (Q356723):
Displaying 19 items.
- Computing the ball size of frequency permutations under Chebyshev distance (Q417597) (← links)
- Remoteness of permutation codes (Q427818) (← links)
- Proof of a conjecture of Kløve on permutation codes under the Chebychev distance (Q521871) (← links)
- Coding with injections (Q690670) (← links)
- A new table of permutation codes (Q766240) (← links)
- A class of maximal permutation cliques (Q793037) (← links)
- A random construction for permutation codes and the covering radius (Q851770) (← links)
- Using permutation rational functions to obtain permutation arrays with large Hamming distance (Q2153758) (← links)
- Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric (Q2234465) (← links)
- Decoding mixed errors and erasures in permutation codes (Q2256109) (← links)
- Constructing permutation arrays using partition and extension (Q2291664) (← links)
- A note on good permutation codes from Reed-Solomon codes (Q2324769) (← links)
- Twisted permutation codes (Q2342291) (← links)
- Semidefinite programming for permutation codes (Q2449151) (← links)
- Diagonally neighbour transitive codes and frequency permutation arrays (Q2454089) (← links)
- The packing radius of a poset block code (Q2788721) (← links)
- Spearman permutation distances and Shannon's distinguishability (Q2898471) (← links)
- Infinity-Norm Permutation Covering Codes From Cyclic Groups (Q4682831) (← links)
- Maximum independent sets and supervised learning (Q6151016) (← links)