most citedSemidefinite programming bounds for binary codes from a split Terwilliger algebra

3 citations · 7 across the 5 of their papers we have counts for

collaborators

5 papers

quant-ph2023★ 2 cited

Semidefinite programming bounds on the size of entanglement-assisted codeword stabilized quantum codes

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

In this paper, we explore the application of semidefinite programming to the realm of quantum codes, specifically focusing on codeword stabilized (CWS) codes with entanglement assi…

cs.SI2023

An Error-Correction Model for Information Transmissions of Social Networks

Daqi Fang, Pin-Chieh Tseng

We study the error-correction problem of the communication between two vertices in a social network. By applying the concepts of coding theory into the Social Network Analysis (SNA…

math.CO2022★ 2 cited

On the size of maximal binary codes with 2, 3, and 4 distances

Alexander Barg, Alexey Glazyrin, Wei-Jiun Kao +3

We address the maximum size of binary codes and binary constant weight codes with few distances. Previous works established a number of bounds for these quantities as well as the e…

math.CO2022

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

Alexander Barg, Ching-Yi Lai, Pin-Chieh Tseng +1

We study the maximum cardinality problem of a set of few distances in the Hamming and Johnson spaces. We formulate semidefinite programs for this problem and extend the 2011 works…

cs.IT2022★ 3 cited

Semidefinite programming bounds for binary codes from a split Terwilliger algebra

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

We study the upper bounds for , the maximum size of codewords with length and Hamming distance at least . Schrijver studied the Terwilliger algebra of the Hamming sc…