Globally Optimizing Small Codes in Real Projective Spaces
From MaRDI portal
Publication:5854456
DOI10.1137/19M1307895zbMath1459.05037arXiv1912.03373MaRDI QIDQ5854456
Dustin G. Mixon, Hans Parshall
Publication date: 17 March 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.03373
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- A mathematical introduction to compressive sensing
- The strong thirteen spheres problem
- The road to deterministic matrices with the restricted isometry property
- Geometric properties of Grassmannian frames for \(\mathbb R^2\) and \(\mathbb R^3\)
- Real quantifier elimination is doubly exponential
- Grassmannian frames with applications to coding and communication
- Enumeration of Seidel matrices
- Nearly orthogonal vectors and small antipodal spherical codes
- A semidefinite programming hierarchy for packing problems in discrete geometry
- A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
- Auf welcher Kugel haben 5, 6, 7, 8 oder 9 Punkte mit Mindestabstand Eins Platz?
- Das Problem der dreizehn Kugeln
- Julia: A Fresh Approach to Numerical Computing
- Fingerprinting With Equiangular Tight Frames
- The Tammes Problem for N = 14
- Experimental Study of Energy-Minimizing Point Configurations on Spheres
- Error Detecting and Error Correcting Codes
- Packings in Real Projective Spaces
- Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
- Symmetric informationally complete quantum measurements
- The Optimal Packing of Eight Points in the Real Projective Plane
- Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Distribution of points in the elliptic plane
- JuMP: A Modeling Language for Mathematical Optimization
- Quasi-random graphs
This page was built for publication: Globally Optimizing Small Codes in Real Projective Spaces