New lower bounds for binary constant-dimension subspace codes
From MaRDI portal
Publication:4643732
integer linear programmingpackingrandom network codingmaximum weight clique problemconstant-dimension codes
Integer programming (90C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial structures in finite projective spaces (51E20) Bounds on codes (94B65) Combinatorial aspects of packing and covering (05B40) Spreads and packing problems in finite geometry (51E23)
Recommendations
- A subspace code of size 333 in the setting of a binary \(q\)-analog of the Fano plane
- The interplay of different metrics for the construction of constant dimension codes
- New constant dimension subspace codes from parallel linkage construction and multilevel construction
- Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
- scientific article; zbMATH DE number 7274073
Cites work
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 3125713 (Why is no real title available?)
- scientific article; zbMATH DE number 549386 (Why is no real title available?)
- An infinite class of 4-designs
- Codes and Designs Related to Lifted MRD Codes
- Coding for Errors and Erasures in Random Network Coding
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
- Endliche Gruppen I
- Error-Correcting Codes in Projective Space
- Existence of \(q\)-analogs of Steiner systems
- Heuristic Algorithms for Constructing Binary Constant Weight Codes
- Improved upper bounds for partial spreads
- Large sets of \(t\)-designs over finite fields
- Linear groups containing a Singer cycle
- New lower bounds for the Shannon capacity of odd cycles
- On a class of small 2‐designs over gf(q)
- Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
- Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers
- Some new designs over finite fields
- Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
- The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\)
- The maximum size of a partial spread. II: Upper bounds
- \(q\)-analogs of packing designs
- t-designs on hypergraphs
Cited in
(6)
This page was built for publication: New lower bounds for binary constant-dimension subspace codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4643732)
