Applications of semidefinite programming to coding theory

Abstract

We survey recent generalizations and improvements of the linear programming method that involve semidefinite programming. A general framework using group representations and tools from graph theory is provided.

5 pages; ITW 2010, Dublib : Ireland (2010)

References in corpus (4)

• New upper bounds for kissing numbers from semidefinite programming
• Coding for Errors and Erasures in Random Network Coding
• Bounds for codes and designs in complex subspaces
• Semidefinite code bounds based on quadruple distances