Semidefinite programming bounds for codes in complex projective space
Name
li-rupertli-meng-eecs-2024-thesis.pdf
Description
Thesis PDF
Size
370.72 KB
Format
Adobe PDF
Checksum (MD5)
51925d896e46dc4ab4ce7e778acb4ca4
Author(s)
Li, Rupert
Advisor(s)
Cohn, Henry
Sun, Nike
Date Issued
May 2024
Publisher
Massachusetts Institute of Technology
Abstract
We establish three-point bounds for codes in complex projective space, where previously only two-point linear programming bounds were known. We discuss how these bounds can be computed numerically using semidefinite programming, and provide a framework that allows for proofs of universal optimality through solving finitely many semidefinite programs. We present some numerical computations that demonstrate, in some test examples, that our three-point bounds improve upon two-point bounds.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
In Copyright - Educational Use Permitted
Copyright retained by author(s)
Persistent DSpace Link
