activity
20122026
most citedUpper bounds for -distance sets and equiangular lines

16 citations · 53 across the 30 of their papers we have counts for

collaborators
Showing 2022Show all

8 papers · 1 filter

math.CO2022★ 1 cited

On the two-distance embedding in real Euclidean space of coherent configuration of type (2,2;3)

Eiichi Bannai, Etsuko Bannai, Chin-Yen Lee +2

Finding the maximum cardinality of a -distance set in Euclidean space is a classical problem in geometry. Lisoněk in 1997 constructed a maximum -distance set in …

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…

quant-ph2022

Quantum state tomography via non-convex Riemannian gradient descent

Ming-Chien Hsu, En-Jui Kuo, Wei-Hsuan Yu +2

The recovery of an unknown density matrix of large size requires huge computational resources. The recent Factored Gradient Descent (FGD) algorithm and its variants achieved state-…

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…

math.CO2022

Semidefinite programming bounds for complex spherical codes

Wei-Jiun Kao, Sho Suda, Wei-Hsuan Yu

A complex spherical code is a finite subset on the unit sphere in . A fundamental problem on complex spherical codes is to find upper bounds for those with prescribed…

math.CO2022

Four-point semidefinite bound for equiangular lines

Wei-Jiun Kao, Wei-Hsuan Yu

A set of lines in passing through the origin is called equiangular if any two lines in the set form the same angle. We proved an alternative version of the three-poi…

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…

math.CO2022

The real equiangular tight frames obtained from rank graphs

Eiichi Bannai, Etsuko Bannai, Chin-Yen Lee +2

We present all nontrivial real equiangular tight frames in obtained as spherical embeddings of primitive rank graphs on vertices, and those…