New Lower Bounds for Binary Constant-Dimension Subspace Codes

DOI10.1080/10586458.2016.1239145zbMath1391.51005OpenAlexW2541062436MaRDI QIDQ4643732

Patric R. J. Östergård, Michael Braun, Alfred Wassermann

Publication date: 28 May 2018

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10586458.2016.1239145

zbMATH Keywords

packinginteger linear programmingrandom network codingmaximum weight clique problemconstant-dimension codes

Mathematics Subject Classification ID

Integer programming (90C10) Bounds on codes (94B65) Spreads and packing problems in finite geometry (51E23) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial structures in finite projective spaces (51E20) Combinatorial aspects of packing and covering (05B40)

Related Items (5)

Binary subspace codes in small ambient spaces ⋮ New lower bounds for the Shannon capacity of odd cycles ⋮ Subspace code constructions ⋮ The interplay of different metrics for the construction of constant dimension codes ⋮ Combining subspace codes

Uses Software

• Cliquer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The maximum size of a partial spread. II: Upper bounds
• The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\)
• Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers
• Linear groups containing a Singer cycle
• t-designs on hypergraphs
• Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
• New lower bounds for the Shannon capacity of odd cycles
• Improved upper bounds for partial spreads
• Large sets of \(t\)-designs over finite fields
• EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
• Codes and Designs Related to Lifted MRD Codes
• Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
• q-Analogs of Packing Designs
• Coding for Errors and Erasures in Random Network Coding
• On a class of small 2‐designs over gf(q)
• Heuristic Algorithms for Constructing Binary Constant Weight Codes
• Error-Correcting Codes in Projective Space
• Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
• An infinite class of 4-designs
• Endliche Gruppen I

This page was built for publication: New Lower Bounds for Binary Constant-Dimension Subspace Codes