Share Email Print

Proceedings Paper

The Levenstein bound for packings in projective spaces
Author(s): John I. Haas IV; Nathaniel Hammen; Dustin G. Mixon
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 24 August 2017
PDF: 6 pages
Proc. SPIE 10394, Wavelets and Sparsity XVII, 103940V (24 August 2017); doi: 10.1117/12.2275373
Show Author Affiliations
John I. Haas IV, Univ. of Missouri (United States)
Nathaniel Hammen, Air Force Institute of Technology (United States)
Dustin G. Mixon, Air Force Institute of Technology (United States)

Published in SPIE Proceedings Vol. 10394:
Wavelets and Sparsity XVII
Yue M. Lu; Dimitri Van De Ville; Manos Papadakis, 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?