Pages that link to "Item:Q855871"

The following pages link to New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming (Q855871):

Displaying 39 items.

• New inequalities for \(q\)-ary constant-weight codes (Q398941) (← links)
• Wreath product action on generalized Boolean algebras (Q491535) (← links)
• On Lee association schemes over \(\mathbb{Z}_4\) and their Terwilliger algebra (Q501247) (← links)
• Nonsymmetric Askey-Wilson polynomials and \(Q\)-polynomial distance-regular graphs (Q501689) (← links)
• The triple distribution of codes and ordered codes (Q641207) (← links)
• Symmetric chains, Gelfand--Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme (Q644673) (← links)
• Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming (Q717133) (← links)
• Bounds for codes by semidefinite programming (Q735630) (← links)
• A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4 (Q901158) (← links)
• Terwilliger algebras of wreath products of association schemes (Q905711) (← links)
• Symmetry in semidefinite programs (Q958029) (← links)
• New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra (Q1011516) (← links)
• A survey on spherical designs and algebraic combinatorics on spheres (Q1039420) (← links)
• Commutative association schemes (Q1039424) (← links)
• Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
• Symmetric sums of squares over \(k\)-subset hypercubes (Q1702778) (← links)
• An Assmus-Mattson theorem for codes over commutative association schemes (Q1744016) (← links)
• Semidefinite bounds for mixed binary/ternary codes (Q1744761) (← links)
• The quantum adjacency algebra and subconstituent algebra of a graph (Q2000651) (← links)
• Pseudo-direct sums and wreath products of loose-coherent algebras with applications to coherent configurations (Q2013186) (← links)
• The Terwilliger algebra of the halved \(n\)-cube from the viewpoint of its automorphism group action (Q2066017) (← links)
• On the non-existence of extended 1-perfect codes and MDS codes (Q2120824) (← links)
• The Terwilliger algebra of the halved folded \(2n\)-cube from the viewpoint of its automorphism group action (Q2159397) (← links)
• Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces (Q2278701) (← links)
• New code upper bounds for the folded \(n\)-cube (Q2299631) (← links)
• Semidefinite programming bounds for Lee codes (Q2312798) (← links)
• New lower bounds on \(q\)-ary error-correcting codes (Q2325290) (← links)
• Design theory from the viewpoint of algebraic combinatorics (Q2361074) (← links)
• Semidefinite bounds for nonbinary codes based on quadruples (Q2364626) (← links)
• High dimensional Hoffman bound and applications in extremal combinatorics (Q2700317) (← links)
• Invariant Semidefinite Programs (Q2802527) (← links)
• New upper bounds for kissing numbers from semidefinite programming (Q3577299) (← links)
• Tight relative t-designs on two shells in hypercubes, and Hahn and Hermite polynomials (Q5074500) (← links)
• Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling (Q5152478) (← links)
• TD-pairs and the $q$-Onsager algebra (Q5197955) (← links)
• A diagram associated with the subconstituent algebra of a distance-regular graph (Q5217068) (← links)
• New Bounds for Equiangular Lines and Spherical Two-Distance Sets (Q5346565) (← links)
• The Clebsch-Gordan rule for \(U(\mathfrak{sl}_2)\), the Krawtchouk algebras and the Hamming graphs (Q6042952) (← links)
• Semidefinite programming bounds for binary codes from a split Terwilliger algebra (Q6074024) (← links)