Pages that link to "Item:Q1279874"
From MaRDI portal
The following pages link to Upper bounds on permutation codes via linear programming (Q1279874):
Displayed 18 items.
- Permutation codes with specified packing radius (Q356723) (← links)
- Coding with injections (Q690670) (← links)
- A new table of permutation codes (Q766240) (← links)
- On the construction of permutation arrays via mappings from binary vectors to permutations (Q851743) (← links)
- A random construction for permutation codes and the covering radius (Q851770) (← links)
- Linear programming bounds for regular graphs (Q897255) (← links)
- Permutation codes (Q966159) (← links)
- Commutative association schemes (Q1039424) (← links)
- Designs in finite metric spaces: a probabilistic approach (Q2051880) (← links)
- The maximum clique problem for permutation Hamming graphs (Q2156387) (← links)
- Bounds on permutation codes of distance four (Q2269535) (← links)
- Study of tangle on the three qubit Werner states by using of twirl operation (Q2308395) (← links)
- Semidefinite programming for permutation codes (Q2449151) (← links)
- The covering radius of permutation designs (Q2688257) (← links)
- Invariant Semidefinite Programs (Q2802527) (← links)
- Fundamentals of coding type problems (Q3637813) (← links)
- New nonexistence results on perfect permutation codes under the Hamming metric (Q6047439) (← links)
- New upper bounds on the size of permutation codes under Kendall \(\tau\)-metric (Q6086190) (← links)