Share Email Print

Proceedings Paper

Game of Sloanes: best known packings in complex projective space
Author(s): John Jasper; Emily J. King; Dustin G. Mixon
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

It is often of interest to identify a given number of points in projective space such that the minimum distance between any two points is as large as possible. Such configurations yield representations of data that are optimally robust to noise and erasures. The minimum distance of an optimal configuration not only depends on the number of points and the dimension of the projective space, but also on whether the space is real or complex. For decades, Neil Sloane’s online Table of Grassmannian Packings has been the go-to resource for putatively or provably optimal packings of points in real projective spaces. Using a variety of numerical algorithms, we have created a similar table for complex projective spaces. This paper surveys the relevant literature, explains some of the methods used to generate the table, presents some new putatively optimal packings, and invites the reader to competitively contribute improvements to this table.

Paper Details

Date Published: 9 September 2019
PDF: 10 pages
Proc. SPIE 11138, Wavelets and Sparsity XVIII, 111381E (9 September 2019); doi: 10.1117/12.2527956
Show Author Affiliations
John Jasper, South Dakota State Univ. (United States)
Emily J. King, Univ. Bremen (Germany)
Colorado State Univ. (United States)
Dustin G. Mixon, The Ohio State Univ. (United States)

Published in SPIE Proceedings Vol. 11138:
Wavelets and Sparsity XVIII
Dimitri Van De Ville; Manos Papadakis; Yue M. Lu, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?