In 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

• Zahid, Nadia Seher
• Nahabedian, Aaron Joseph

Publisher

• Worcester Polytechnic Institute

Identifier

• E-project-043009-161646

Advisor

• Martin, William J.

Year

• 2009

Date created

• 2009-04-30

Resource type

• Major Qualifying Project

Major

• Mathematical Sciences

Rights statement

• In Copyright

Last modified

• 2021-01-06