24 August 2017 The Levenstein bound for packings in projective spaces
Author Affiliations +
Abstract
We study the problem of packing points in real or complex projective space so that the minimum distance is maximized. Existing bounds for this problem include the Welch and orthoplex bounds. This paper discusses the Levenstein bound, which follows from Delsarte's linear programming bound. We highlight the relationship between the Welch and Levenstein bounds.
Conference Presentation
© (2017) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
John I. Haas, John I. Haas, Nathaniel Hammen, Nathaniel Hammen, Dustin G. Mixon, Dustin G. Mixon, } "The Levenstein bound for packings in projective spaces", Proc. SPIE 10394, Wavelets and Sparsity XVII, 103940V (24 August 2017); doi: 10.1117/12.2275373; https://doi.org/10.1117/12.2275373
PROCEEDINGS
6 PAGES + PRESENTATION

SHARE
Back to Top