Matrix Algebras and Semidefinite Programming Techniques for Codes

Abstract

This PhD thesis is concerned with SDP bounds for codes: upper bounds for (non)-binary error correcting codes and lower bounds for (non)-binary covering codes. The methods are based on the method of Schrijver that uses triple distances in stead of pairs as in the classical Delsarte bound. The main topics discussed are: 1) Block-diagonalisation of matrix *-algebras, 2) Terwilliger-algebra of the nonbinary Hamming scheme (including an explicit block-diagonalisation), 3) SDP-bounds for (nonbinary) error-correcting codes and covering codes (including computational results), 4) Discussion on the relation with matrix-cuts, 5) Computational results for Affine caps.

PhD Thesis (2005), about 100 pages

Cited by in corpus (16)

• Distance-regular graphs
• Commutative association schemes
• Upper bounds for packings of spheres of several radii
• When is a Quantum Cellular Automaton (QCA) a Quantum Lattice Gas Automaton (QLGA)?
• Dimension reduction for semidefinite programs via Jordan algebras
• Numerical method for finding decoherence-free subspaces and its applications
• Parallelization of Adaptive Quantum Channel Discrimination in the Non-Asymptotic Regime
• Lecture notes: Semidefinite programs and harmonic analysis
• Minimal noise subsystems
• A hierarchy of efficient bounds on quantum capacities exploiting symmetry
• The maximum cardinality of trifferent codes with lengths 5 and 6
• New Methods in Coding Theory: Error-Correcting Codes and the Shannon Capacity
• An Axiomatic Duality Framework for the Theta Body and Related Convex Corners
• Facial Reduction for Symmetry Reduced Semidefinite Doubly Nonnegative Programs
• Tight relative $t$-designs on two shells in hypercubes, and Hahn and Hermite polynomials
• Exactness in SDP relaxations of QCQPs: Theory and applications