Semidefinite programming for permutation codes
From MaRDI portal
Publication:2449151
DOI10.1016/j.disc.2014.03.002zbMath1332.94107arXiv1212.1185OpenAlexW1486394389MaRDI QIDQ2449151
Mathieu Bogaerts, Peter J. Dukes
Publication date: 6 May 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.1185
Semidefinite programming (90C22) Combinatorial aspects of representation theory (05E10) Combinatorial codes (94B25)
Cites Work
- Unnamed Item
- Unnamed Item
- Permutation codes with specified packing radius
- New upper bounds for the size of permutation codes via linear programming
- Coding with injections
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- A random construction for permutation codes and the covering radius
- Symmetry in semidefinite programs
- Commutative association schemes
- On the maximum number of permutations with given maximal or minimal distance
- Bounds for permutation arrays
- Upper bounds on permutation codes via linear programming
- Covering radius for sets of permutations
- Constructions for permutation codes in powerline communications
- Bounds on permutation codes of distance four
- On constant composition codes
- The Symmetric Group as Metric Space
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
- Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
- THE TERWILLIGER ALGEBRAS OF THE GROUP ASSOCIATION SCHEMES OF S5 AND A5
- Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
- Intersecting families of permutations