Small codes
I Balla - Bulletin of the London Mathematical Society, 2024 - Wiley Online Library
Determining the maximum number of unit vectors in R r R^r with no pairwise inner product
exceeding α α is a fundamental problem in geometry and coding theory. In 1955, Rankin …
exceeding α α is a fundamental problem in geometry and coding theory. In 1955, Rankin …
Small codes
I Balla - arXiv preprint arXiv:2305.19047, 2023 - arxiv.org
Determining the maximum number of unit vectors in $\mathbb {R}^ r $ with no pairwise inner
product exceeding $\alpha $ is a fundamental problem in geometry and coding theory. In …
product exceeding $\alpha $ is a fundamental problem in geometry and coding theory. In …
Small codes
I Balla - arXiv e-prints, 2023 - ui.adsabs.harvard.edu
Determining the maximum number of unit vectors in $\mathbb {R}^ r $ with no pairwise inner
product exceeding $\alpha $ is a fundamental problem in geometry and coding theory. In …
product exceeding $\alpha $ is a fundamental problem in geometry and coding theory. In …
[PDF][PDF] Small codes
I Balla - arXiv preprint arXiv:2305.19047, 2023 - researchgate.net
Determining the maximum number of unit vectors in Rr with no pairwise inner product
exceeding α is a fundamental problem in geometry and coding theory. In 1955, Rankin …
exceeding α is a fundamental problem in geometry and coding theory. In 1955, Rankin …