A Solution of the Energy Minimization Problem for Codes of Codimension 1

Abstract

In this thesis, we study the space of quasicodes using Delsarte’s linear programming bound to solve the energy minimization problem on codes. Our main contribution is we give the optimal code of codimension 1 for any potential function. We also investigate the polytope of quasicodes, where we give a symmetry and a list of vertices in some special cases.