arXiv · 1907.05589
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_{ii} = 1$ and $|G_{ij}| \leq ε$ for $1 \leq i \neq j \leq 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$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Robi Bhattacharjee. 2019-07-12. Optimally Perturbed Identity Matrices of Rank 2. https://arxiv.org/abs/1907.05589
Cite the original work for its findings. Save a collection to share your selection of sources.