Semidefinite bounds for nonbinary codes based on quadruples
From MaRDI portal
Publication:2364626
DOI10.1007/s10623-016-0216-5zbMath1404.94155arXiv1602.02531OpenAlexW2267943254WikidataQ59515607 ScholiaQ59515607MaRDI QIDQ2364626
Bart Litjens, Sven C. Polak, Alexander Schrijver
Publication date: 21 July 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.02531
Semidefinite programming (90C22) Combinatorial aspects of representation theory (05E10) Representations of finite symmetric groups (20C30) Bounds on codes (94B65)
Related Items (13)
\(k\)-point semidefinite programming bounds for equiangular lines ⋮ Semidefinite programming bounds for binary codes from a split Terwilliger algebra ⋮ Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting) ⋮ Symmetric sums of squares over \(k\)-subset hypercubes ⋮ New nonbinary code bounds based on divisibility arguments ⋮ Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling ⋮ Semidefinite bounds for mixed binary/ternary codes ⋮ Uniqueness of codes using semidefinite programming ⋮ Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces ⋮ Semidefinite programming bounds for Lee codes ⋮ New lower bounds on \(q\)-ary error-correcting codes ⋮ Dual bounds for the positive definite functions approach to mutually unbiased bases ⋮ Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory
Cites Work
- Unnamed Item
- Unnamed Item
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- Semidefinite Code Bounds Based on Quadruple Distances
- Error-correcting codes over an alphabet of four elements
- Bounds on codes over an alphabet of five elements
This page was built for publication: Semidefinite bounds for nonbinary codes based on quadruples
