Pages that link to "Item:Q1948455"
From MaRDI portal
The following pages link to Bounds for projective codes from semidefinite programming (Q1948455):
Displaying 17 items.
- Constructions and bounds for mixed-dimension subspace codes (Q326349) (← links)
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques (Q398965) (← links)
- The Goldman-Rota identity and the Grassmann scheme (Q405125) (← links)
- Wreath product action on generalized Boolean algebras (Q491535) (← links)
- Galois geometries and coding theory (Q908053) (← links)
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps (Q1011505) (← links)
- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases (Q1620975) (← links)
- Binary subspace codes in small ambient spaces (Q1620978) (← links)
- Constructions of optimal Ferrers diagram rank metric codes (Q1755997) (← links)
- Linear programming bounds for codes in infinite projective spaces (Q1818899) (← links)
- New constructions of Sidon spaces (Q2137064) (← links)
- New and updated semidefinite programming bounds for subspace codes (Q2210639) (← links)
- Johnson type bounds for mixed dimension subspace codes (Q2323816) (← links)
- Bounds on the Pseudo-Weight of Minimal Pseudo-Codewords of Projective Geometry Codes (Q3435584) (← links)
- Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2 (Q5205027) (← links)
- New lower bounds for partial k‐parallelisms (Q6185550) (← links)
- The moment-SOS hierarchy: applications and related topics (Q6598421) (← links)