Bounds for projective codes from semidefinite programming

2012/05/31 by Christine Bachoc, Alberto Passuello, Frank Vallentin · 1 citation
Computer Science · Mathematics · #cs.IT #math.IT

paper · pdf · doi:10.3934/amc.2013.7.127

published as Advances in mathematics of communications 7, 2 (2013) 127-145

arxiv created 2013/04/24 · arxiv updated 2013/11/05

Abstract

We apply the semidefinite programming method to derive bounds for projective codes over a finite field.

Cited by

• P-polynomial coherent configurations

Related

• Bounding minimum distances of cyclic codes using algebraic geometry
• Coding Theory and Projective Spaces
• Additive codes from linear codes
• Moments of isotropic measures and optimal projective codes
• On projective q^r-divisible codes