Student Work
A Study of Linear Programming Bounds for Spherical Codes
PublicDownloadable Content
open in viewerIn this paper we present a study of the linear programming technique developed by Delsarte, Goethal and Seidel to find upper bounds on the size of spherical A-codes. Applications of spherical codes to kissing numbers, equiangular lines and the 24-cell are investigated. We develop a software package to find upper bounds for spherical A-codes and we investigate interesting results obtained from this software.
- This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.
- Creator
- Publisher
- Identifier
- E-project-043009-161646
- Advisor
- Year
- 2009
- Date created
- 2009-04-30
- Resource type
- Major
- Rights statement
- Last modified
- 2021-01-06
Relations
- In Collection:
Permanent link to this page: https://digital.wpi.edu/show/h415pc23m