New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
From MaRDI portal
Publication:855871
Recommendations
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra
- scientific article; zbMATH DE number 4047601
- A new upper bound on nonbinary block codes
- Semidefinite bounds for mixed binary/ternary codes
- Bounds for codes by semidefinite programming
- Semidefinite bounds for nonbinary codes based on quadruples
- New and updated semidefinite programming bounds for subspace codes
- Strengthened semidefinite programming bounds for codes
- Improved Semidefinite Programming Bound on Sizes of Codes
Cites work
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- Bounds on codes over an alphabet of five elements
- Bounds on mixed binary/ternary codes
- Error-correcting codes over an alphabet of four elements
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- The subconstituent algebra of an association scheme. I
Cited in
(47)- Strengthened semidefinite programming bounds for codes
- The Clebsch-Gordan rule for \(U(\mathfrak{sl}_2)\), the Krawtchouk algebras and the Hamming graphs
- On the non-existence of extended 1-perfect codes and MDS codes
- Invariant Semidefinite Programs
- The quantum adjacency algebra and subconstituent algebra of a graph
- Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- An Assmus-Mattson theorem for codes over commutative association schemes
- Semidefinite programming for permutation codes
- New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra
- Symmetric chains, Gelfand--Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme
- Wreath product action on generalized Boolean algebras
- Design theory from the viewpoint of algebraic combinatorics
- Semidefinite bounds for nonbinary codes based on quadruples
- Semidefinite programming bounds for Lee codes
- New inequalities for \(q\)-ary constant-weight codes
- A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4
- A new upper bound on nonbinary block codes
- Symmetric sums of squares over \(k\)-subset hypercubes
- Tight relative \(t\)-designs on two shells in hypercubes, and Hahn and Hermite polynomials
- Semidefinite bounds for mixed binary/ternary codes
- Terwilliger algebras of wreath products of association schemes
- Symmetry reduction to optimize a graph-based polynomial from queueing theory
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- The Terwilliger algebra of the halved folded \(2n\)-cube from the viewpoint of its automorphism group action
- TD-pairs and the \(q\)-Onsager algebra
- New bounds for equiangular lines and spherical two-distance sets
- Symmetry in semidefinite programs
- New upper bounds for kissing numbers from semidefinite programming
- The triple distribution of codes and ordered codes
- Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling
- High dimensional Hoffman bound and applications in extremal combinatorics
- Commutative association schemes
- Bounds for codes by semidefinite programming
- The Terwilliger algebra of the halved \(n\)-cube from the viewpoint of its automorphism group action
- New code upper bounds for the folded \(n\)-cube
- On Lee association schemes over \(\mathbb{Z}_4\) and their Terwilliger algebra
- Nonsymmetric Askey-Wilson polynomials and \(Q\)-polynomial distance-regular graphs
- Pseudo-direct sums and wreath products of loose-coherent algebras with applications to coherent configurations
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra
- New nonbinary code bounds based on divisibility arguments
- scientific article; zbMATH DE number 4047601 (Why is no real title available?)
- New lower bounds on \(q\)-ary error-correcting codes
- The Terwilliger algebras of odd graphs and doubled odd graphs
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- A diagram associated with the subconstituent algebra of a distance-regular graph
- A survey on spherical designs and algebraic combinatorics on spheres
This page was built for publication: New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855871)
