Optimal simplices and codes in projective spaces
From MaRDI portal
Abstract: We find many tight codes in compact spaces, i.e., optimal codes whose optimality follows from linear programming bounds. In particular, we show the existence (and abundance) of several hitherto unknown families of simplices in quaternionic projective spaces and the octonionic projective plane. The most noteworthy cases are 15-point simplices in HP^2 and 27-point simplices in OP^2, both of which are the largest simplices and the smallest 2-designs possible in their respective spaces. These codes are all universally optimal, by a theorem of Cohn and Kumar. We also show the existence of several positive-dimensional families of simplices in the Grassmannians of subspaces of R^n with n <= 8; close numerical approximations to these families had been found by Conway, Hardin, and Sloane, but no proof of existence was known. Our existence proofs are computer-assisted, and the main tool is a variant of the Newton-Kantorovich theorem. This effective implicit function theorem shows, in favorable conditions, that every approximate solution to a set of polynomial equations has a nearby exact solution. Finally, we also exhibit a few explicit codes, including a configuration of 39 points in OP^2 that form a maximal system of mutually unbiased bases. This is the last tight code in OP^2 whose existence had been previously conjectured but not resolved.
Recommendations
- scientific article; zbMATH DE number 6902639
- Optimal Few-Weight Codes From Simplicial Complexes
- Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes
- On certain projective geometry codes (Corresp.)
- Linear programming bounds for codes in infinite projective spaces
- Some optimal codes from algebraic geometry and their covering radii
- On the Bounds of Certain Maximal Linear Codes in a Projective Space
- Linear codes from projective spaces
- The dimension of projective geometry codes
- Minimal codewords arising from the incidence of points and hyperplanes in projective spaces
Cited in
(26)- POINT DISTRIBUTIONS IN TWO‐POINT HOMOGENEOUS SPACES
- Repeated minimizers of \(p\)-frame energies
- \(p\)-adic Welch bounds and \(p\)-adic Zauner conjecture
- Naimark-spatial families of equichordal tight fusion frames
- Metric problems in projective and Grassmann spaces
- Harmonic Grassmannian codes
- Optimal configurations of lines and a statistical application
- Minimal codewords arising from the incidence of points and hyperplanes in projective spaces
- The topology of projective codes and the distribution of zeros of odd maps
- Nearly orthogonal vectors and small antipodal spherical codes
- Stolarsky's invariance principle for projective spaces
- Nearly orthogonal vectors and small antipodal spherical codes
- Orthogonal realizations of random sign patterns and other applications of the SIPP
- Frames over finite fields: basic theory and equiangular lines in unitary geometry
- Grassmannian codes from paired difference sets
- New dense superball packings in three dimensions
- Octonions and the two strictly projective tight 5-designs
- Trace optimality of SIC POVMs
- Optimal measures for \(p\)-frame energies on spheres
- On the search for tight frames of low coherence
- Admissibility and frame homotopy for quaternionic frames
- Globally optimizing small codes in real projective spaces
- scientific article; zbMATH DE number 6902639 (Why is no real title available?)
- Effective bounds for monochromatic connectivity measures in two dimensions
- Frame Potential in CPn Some Numerical and Analytical Results
- Packings in real projective spaces
This page was built for publication: Optimal simplices and codes in projective spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q309017)
