New lower bounds for binary constant-dimension subspace codes

DOI10.1080/10586458.2016.1239145zbMATH Open1391.51005OpenAlexW2541062436MaRDI QIDQ4643732FDOQ4643732

Authors: Michael Braun, Patric R. J. Östergård, 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

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

zbMATH Keywords

integer linear programmingpackingrandom network codingmaximum weight clique problemconstant-dimension codes

Mathematics Subject Classification ID

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)

Cites Work

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

Cited In (6)

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

Uses Software

• Cliquer

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)