Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 (Q1727355): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10623-018-0544-8 / 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: EXISTENCE OF -ANALOGS OF STEINER SYSTEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilinear forms over a finite field, with applications to coding theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes and Designs Related to Lifted MRD Codes / 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: Theory of codes with maximum rank distance / 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: Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 / 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: Coding for Errors and Erasures in Random Network Coding / 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: Maximum-rank array codes and their application to crisscross error correction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Johnson type bounds on constant dimension codes / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129300699 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10623-018-0544-8 / rank
 
Normal rank

Latest revision as of 06:02, 11 December 2024

scientific article
Language Label Description Also known as
English
Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
scientific article

    Statements

    Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 February 2019
    0 references
    network coding
    0 references
    constant-dimension codes
    0 references
    subspace distance
    0 references
    classification
    0 references
    integer linear programming
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references