New and updated semidefinite programming bounds for subspace codes

DOI10.3934/AMC.2020034MaRDI QIDQ2210639zbMATH OpenOpenAlexWikidataFDO

Authors Daniel Heinlein, Ferdinand Ihringer

Publication date 7 November 2020

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1809.09352

zbMATH Keywords

semidefinite programmingnetwork codingcoherent configurationfinite projective spacesubspace codesubspace distance

Mathematics Subject Classification ID

Semidefinite programming (90C22) Combinatorial aspects of finite geometries (05B25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial structures in finite projective spaces (51E20) Combinatorial codes (94B25)

Abstract: We show that $A_2(7,4)leq388$ and, more generally, $A_q(7,4)leq(q^2-q+1)[7{]}_q+q^4-2q^3+3q^2-4q+4$ by semidefinite programming for $qleq101$. Furthermore, we extend results by Bachoc et al. on SDP bounds for $A_2(n,d)$, where $d$ is odd and $n$ is small, to $A_q(n,d)$ for small $q$ and small $n$.

Recommendations

• Semidefinite bounds for nonbinary codes based on quadruples
• Strengthened semidefinite programming bounds for codes
• Bounds for projective codes from semidefinite programming
• Bounds for codes by semidefinite programming
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1342088 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• A new approach for examining \(q\)-Steiner systems
• A subspace code of size 333 in the setting of a binary \(q\)-analog of the Fano plane
• An addition theorem for some q-Hahn polynomials
• Bounds for projective codes from semidefinite programming
• Bounds on subsets of coherent configurations
• Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
• Coding for Errors and Erasures in Random Network Coding
• Coherent algebras
• Coherent configurations. I: Ordinary representation theory
• Coherent configurations. II: Weights
• Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
• Constructions and bounds for mixed-dimension subspace codes
• Designs and partial geometries over finite fields
• Designs over finite fields
• Error-Correcting Codes in Projective Space
• Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
• Existence of \(q\)-analogs of Steiner systems
• Intersection numbers for subspace designs
• Johnson type bounds for mixed dimension subspace codes
• Latest Developments in the SDPA Family for Solving Large-Scale SDPs
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• On \(q\)-analogs of Steiner systems and covering designs
• On a class of small 2‐designs over gf(q)
• On putative \(q\)-analogues of the Fano plane and related combinatorial structures
• On the automorphism group of a binary q-analog of the Fano plane
• On the existence of a \((2,3)\)-spread in \(V(7,2)\).
• Partial spreads in finite projective spaces and partial designs
• Semidefinite Programming
• The order of the automorphism group of a binary \(q\)-analog of the Fano plane is at most two
• Tightness in subset bounds for coherent configurations
• \(q\)-analogs of packing designs

Cited in

(3)

• New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
• Semidefinite bounds for nonbinary codes based on quadruples
• Bounds for projective codes from semidefinite programming

This page was built for publication: New and updated semidefinite programming bounds for subspace codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2210639)