Johnson type bounds for mixed dimension subspace codes (Q2323816): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1808.03580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariant Semidefinite Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for projective codes from semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial spreads in finite projective spaces and partial designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial t-spreads and group constructible \((s,r,\mu)\)-nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Galois geometries and coding theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error-Correcting Codes in Projective Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subspace code of size 333 in the setting of a binary \(q\)-analog of the Fano plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary subspace codes in small ambient spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions and bounds for mixed-dimension subspace codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3285920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for partial spreads / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4595216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum size of a partial spread in a finite projective space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Teoria di Galois, fibrazioni proiettive e geometrie non desarguesiane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Johnson type bounds on constant dimension codes / rank
 
Normal rank

Latest revision as of 10:12, 20 July 2024

scientific article
Language Label Description Also known as
English
Johnson type bounds for mixed dimension subspace codes
scientific article

    Statements

    Johnson type bounds for mixed dimension subspace codes (English)
    0 references
    0 references
    0 references
    0 references
    12 September 2019
    0 references
    Summary: Subspace codes, i.e., sets of subspaces of \(\mathbb{F}_q^v\), are applied in random linear network coding. Here we give improved upper bounds for their cardinalities based on the Johnson bound for constant dimension codes.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references