Semidefinite programming bounds for binary codes from a split Terwilliger algebra

03/13/2022
by   Pin-Chieh Tseng, et al.
0

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) and A(19, 4) to 6551 and 13087, respectively.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/27/2022

Semidefinite programming bounds for few-distance sets in the Hamming and Johnson spaces

We study the maximum cardinality problem of a set of few distances in th...
research
08/13/2019

Pair correlation for Dedekind zeta functions of abelian extensions

Here we study problems related to the proportions of zeros, especially s...
research
05/05/2020

Primes in arithmetic progressions and semidefinite programming

Assuming the generalized Riemann hypothesis, we give asymptotic bounds o...
research
06/06/2022

New lower bounds on crossing numbers of K_m,n from permutation modules and semidefinite programming

In this paper, we use semidefinite programming and representation theory...
research
11/07/2016

SPECTRA -a Maple library for solving linear matrix inequalities in exact arithmetic

This document describes our freely distributed Maple library spectra, f...
research
01/06/2018

Refinements of Levenshtein bounds in q-ary Hamming spaces

We develop refinements of the Levenshtein bound in q-ary Hamming spaces ...
research
08/19/2020

Matchings, hypergraphs, association schemes, and semidefinite optimization

We utilize association schemes to analyze the quality of semidefinite pr...

Please sign up or login with your details

Forgot password? Click here to reset