Optimally Perturbed Identity Matrices of Rank 2

Abstract: The problem of optimal antipodal codes can be framed as finding low rank Gram matrices

G

with

G_{i i} = 1

and

| G_{i j} | l e q e p s i l o n

for

1 l e q i e q j l e q n

. In 2018, Bukh and Cox introduced a new bounding technique by removing the condition that

G

be a gram matrix. In this work, we investigate how tight this relaxation is, and find exact results for real valued matrices of rank

2

.

This page was built for publication: Optimally Perturbed Identity Matrices of Rank 2