Bounds for projective codes from semidefinite programming

Abstract

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

References in corpus (2)

• New upper bounds for kissing numbers from semidefinite programming
• Symmetry in semidefinite programs

Cited by in corpus (3)

• Bounds on List Decoding of Rank-Metric Codes
• Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
• On the lengths of divisible codes