Corpus ID: 221376506

Uniquely optimal codes of low complexity are symmetric

@article{Cox2020UniquelyOC,
  title={Uniquely optimal codes of low complexity are symmetric},
  author={C. Cox and E. King and Dustin G. Mixon and H. Parshall},
  journal={ArXiv},
  year={2020},
  volume={abs/2008.12871}
}
  • C. Cox, E. King, +1 author H. Parshall
  • Published 2020
  • Computer Science, Mathematics
  • ArXiv
  • We formulate explicit predictions concerning the symmetry of optimal codes in compact metric spaces. This motivates the study of optimal codes in various spaces where these predictions can be tested. 

    Figures from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 30 REFERENCES
    Codes on euclidean spheres
    • 75
    • PDF
    The chromatic number of the plane is at least 5
    • 45
    • PDF
    The sphere packing problem in dimension 24
    • 168
    • PDF
    Sphere packings, I
    • T. Hales
    • Mathematics, Computer Science
    • 1997
    • 1,383
    • Highly Influential
    • PDF
    The Closest Packing of Spherical Caps in n Dimensions
    • 186
    • PDF
    NEW LATTICE PACKINGS OF SPHERES
    • 56
    • PDF
    Universally optimal distribution of points on spheres
    • 270
    • PDF
    Doubly transitive lines II: Almost simple symmetries
    • 2
    • PDF
    Towards a proof of the 24-cell conjecture
    • 7
    • PDF