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

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.

Name thesis:degree_name

Doctoral

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Mathematics

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2022

Author dc:creator

• Zhang, Yichi

Advisor dc:contributor.advisor

• Cohn, Henry

Statement dc:rights

• In Copyright - Educational Use Permitted
• Copyright MIT

Licence dc:rights.uri

• http://rightsstatements.org/page/InC-EDU/1.0/

Handle dc:identifier.uri

https://hdl.handle.net/1721.1/147485

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/147485