The Levenstein bound for packings in projective spaces

John I. Haas IV; Nathaniel Hammen; Dustin G. Mixon

doi:10.1117/12.2275373

24 August 2017 The Levenstein bound for packings in projective spaces

John I. Haas IV, Nathaniel Hammen, Dustin G. Mixon

Proceedings Volume 10394, Wavelets and Sparsity XVII; 103940V (2017) https://doi.org/10.1117/12.2275373
Event: SPIE Optical Engineering + Applications, 2017, San Diego, California, United States

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

Citation Download Citation

John I. Haas IV, Nathaniel Hammen, and Dustin G. Mixon "The Levenstein bound for packings in projective spaces", Proc. SPIE 10394, Wavelets and Sparsity XVII, 103940V (24 August 2017); https://doi.org/10.1117/12.2275373

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available