Project Type MQP Submission date 2009-04-30 Authors Aaron J Nahabedian, aaronaha@WPI.EDU, MA Nadia Seher Zahid, MA URN E-project-043009-161646 Title A Study of Linear Programming Bounds for Spherical Codes Advisor Martin, William J, MA Availability unrestricted Abstract
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.
Files mqp.pdf There is one file which has been withheld at the advisor's request.
Browse by Author | Browse by Department | Search all available E-projects
![[WPI]](/Buttons/seal.gif){kind=small}
![[Library]](/Academics/Library/Buttons/lib.gif){kind=small}
![[Home]](/Buttons/home.gif){kind=small}
![[Top]](/Buttons/top.gif){kind=small}