Equidistant codes in the Grassmannian (Q2345600): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Partial spreads in finite projective spaces and partial designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4376259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearity and complements in projective space / 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: Une propriété extremale des plans projectifs finis dans une classe de codes équidistants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every large set of equidistant (0,+1,-1)-vectors forms a sunflower / 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: The maximum size of a partial 3-spread in a finite vector space over \(\mathrm{GF}(2)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / 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: Error-Correcting Codes in Projective Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Ko-Rado theorem for vector spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equidistant constant weight codes / 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: Constant-Rank Codes and Their Connection to Constant-Dimension Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for equidistant codes and partial projective planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equidistant codes with distance 12 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Osculating Spaces of Varieties and Linear Network Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Class of Maximal Codes ror Computer Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems for systems of finite vector spaces / 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: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes / 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: A Rank-Metric Approach to Error Control in Random Network Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Johnson type bounds on constant dimension codes / rank
 
Normal rank

Latest revision as of 02:42, 10 July 2024

scientific article
Language Label Description Also known as
English
Equidistant codes in the Grassmannian
scientific article

    Statements

    Equidistant codes in the Grassmannian (English)
    0 references
    0 references
    0 references
    22 May 2015
    0 references
    constant rank codes
    0 references
    equidistant codes
    0 references
    Grassmannian
    0 references
    Plücker embedding
    0 references
    sunflower
    0 references
    0 references
    0 references
    0 references

    Identifiers

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