The following pages link to A new table of permutation codes (Q766240):
Displaying 15 items.
- Permutation codes with specified packing radius (Q356723) (← links)
- Extending permutation arrays: improving MOLS bounds (Q521869) (← links)
- Constructing permutation arrays from groups (Q1744019) (← links)
- Using permutation rational functions to obtain permutation arrays with large Hamming distance (Q2153758) (← links)
- The maximum clique problem for permutation Hamming graphs (Q2156387) (← links)
- Decoding mixed errors and erasures in permutation codes (Q2256109) (← links)
- A lower bound on permutation codes of distance \(n-1\) (Q2285776) (← links)
- Constructing permutation arrays using partition and extension (Q2291664) (← links)
- A note on good permutation codes from Reed-Solomon codes (Q2324769) (← links)
- New lower bounds for permutation arrays using contraction (Q2324789) (← links)
- Permutation codes invariant under isometries (Q2345924) (← links)
- A new metric on symmetric groups and applications to block permutation codes (Q6041587) (← links)
- New nonexistence results on perfect permutation codes under the Hamming metric (Q6047439) (← links)
- Multiple contractions of permutation arrays (Q6083967) (← links)
- Maximum independent sets and supervised learning (Q6151016) (← links)
