From Event: SPIE Optical Engineering + Applications, 2017
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.
John I. Haas, Nathaniel Hammen, and Dustin G. Mixon, "The Levenstein bound for packings in projective spaces," Proc. SPIE 10394, Wavelets and Sparsity XVII, 103940V (Presented at SPIE Optical Engineering + Applications: August 07, 2017; Published: 24 August 2017); https://doi.org/10.1117/12.2275373.
Conference Presentations are recordings of oral presentations given at SPIE conferences and published as part of the conference proceedings. They include the speaker's narration along with a video recording of the presentation slides and animations. Many conference presentations also include full-text papers. Search and browse our growing collection of more than 12,000 conference presentations, including many plenary and keynote presentations.