Faculty Advisor

Martin, William J

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.

Publisher

Worcester Polytechnic Institute

Date Accepted

April 2009

Major

Mathematical Sciences

Project Type

Major Qualifying Project

Accessibility

Unrestricted

Advisor Department

Mathematical Sciences

Share

COinS