Uniquely optimal codes of low complexity are symmetric
From MaRDI portal
Cites work
- A Finite Packing Problem
- Arrangement of 24 points on a sphere
- Codes on Euclidean spheres
- Densest Packings of Congruent Circles in an Equilateral Triangle
- Doubly transitive lines. I: Higman pairs and roux
- Doubly transitive lines. II: Almost simple symmetries
- Experimental study of energy-minimizing point configurations on spheres
- Higher order Fourier analysis
- scientific article; zbMATH DE number 1881995 (Why is no real title available?)
- scientific article; zbMATH DE number 3217531 (Why is no real title available?)
- New Lattice Packings of Spheres
- On the Erdős distinct distances problem in the plane
- Optimal arrangements in packing congruent balls in a spherical container
- Optimal packings of congruent circles on a square flat torus
- Optimal packings of up to six equal circles on a triangular flat torus
- Patterns and structures in disk packings
- Periodic planar disc packings
- SIC-POVMs and the Stark Conjectures
- Sphere packings, lattices and groups. With additional contributions by E. Bannai, R. E. Borcherds, J. Leech, S. P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov.
- The Approximation of Numbers as Sums of Reciprocals
- The chromatic number of the plane is at least 5
- The Closest Packing of Spherical Caps in n Dimensions
- The contact polytope of the Leech lattice
- The Tammes problem for N = 14
- Towards a proof of the 24-cell conjecture
- Universally optimal distribution of points on spheres
- Über die dichteste Kugellagerung
This page was built for publication: Uniquely optimal codes of low complexity are symmetric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233540)
