Semidefinite programming bounds for binary codes from a split Terwilliger algebra

DOI10.1007/S10623-023-01250-4zbMATH Open1530.94069arXiv2203.06568OpenAlexW4379985554MaRDI QIDQ6074024FDOQ6074024

Authors: Pin-Chieh Tseng, Ching-Yi Lai, Wei-Hsuan Yu 

Publication date: 12 October 2023

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: We study the upper bounds for $A(n,d)$, the maximum size of codewords with length $n$ and Hamming distance at least $d$. Schrijver studied the Terwilliger algebra of the Hamming scheme and proposed a semidefinite program to bound $A(n,d)$. We derive more sophisticated matrix inequalities based on a split Terwilliger algebra to improve Schrijver's semidefinite programming bounds on $A(n,d)$. In particular, we improve the semidefinite programming bounds on $A(18,4)$ to $6551$.

Full work available at URL: https://arxiv.org/abs/2203.06568

zbMATH Keywords

Terwilliger algebrabinary codessemidefinite programdistance distributionweight enumeration

Mathematics Subject Classification ID

Semidefinite programming (90C22) Bounds on codes (94B65)

Cites Work

• Graph implementations for nonsmooth convex programs
• The subconstituent algebra of an association scheme. I
• The subconstituent algebra of an association scheme. II
• Mac Williams identities and coordinate partitions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounds for binary codes of length less than 25
• Binary codes with a minimum distance of four (Corresp.)
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• A comparison of the Delsarte and Lovász bounds
• Semidefinite Code Bounds Based on Quadruple Distances
• Strengthened semidefinite programming bounds for codes
• New upper bounds for kissing numbers from semidefinite programming
• Improved upper bounds on sizes of codes
• Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
• Improved Semidefinite Programming Bound on Sizes of Codes
• New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
• New Bounds for Spherical Two-Distance Sets
• Bounds on three- and higher-distance sets
• Bounds on sets with few distances
• Linear Programming Bounds for Entanglement-Assisted Quantum Error-Correcting Codes by Split Weight Enumerators
• Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
• Semidefinite bounds for nonbinary codes based on quadruples
• New bounds for equiangular lines
• The sextuply shortened binary Golay code is optimal
• Semidefinite Programming Bounds for Constant-Weight Codes
• New code upper bounds for the folded \(n\)-cube
• Algebraic combinatorics. Translated from the Japanese

Cited In (4)

• Computing separability elements for the sentence-ambient algebra of split ideal codes
• Semidefinite bounds for mixed binary/ternary codes
• New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
• Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps

This page was built for publication: Semidefinite programming bounds for binary codes from a split Terwilliger algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6074024)