Bounds for projective codes from semidefinite programming
From MaRDI portal
Abstract: We apply the semidefinite programming method to derive bounds for projective codes over a finite field.
Recommendations
- Bounds for codes by semidefinite programming
- Linear programming bounds for codes in grassmannian spaces
- Strengthened semidefinite programming bounds for codes
- New and updated semidefinite programming bounds for subspace codes
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
Cited in
(18)- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
- Binary subspace codes in small ambient spaces
- Constructions of optimal Ferrers diagram rank metric codes
- Linear programming bounds for codes in infinite projective spaces
- New constructions of Sidon spaces
- New and updated semidefinite programming bounds for subspace codes
- Johnson type bounds for mixed dimension subspace codes
- Constructions and bounds for mixed-dimension subspace codes
- Bounds on the Pseudo-Weight of Minimal Pseudo-Codewords of Projective Geometry Codes
- Linear programming bounds for codes in grassmannian spaces
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
- The Goldman-Rota identity and the Grassmann scheme
- Wreath product action on generalized Boolean algebras
- Bounds on subspace codes based on orthogonal space over finite fields of characteristic 2
- New lower bounds for partial k‐parallelisms
- The moment-SOS hierarchy: applications and related topics
- Galois geometries and coding theory
This page was built for publication: Bounds for projective codes from semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1948455)
