Bounds on subspace codes based on totally isotropic subspaces in unitary spaces (Q5298339): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Perfect byte-correcting codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error-Correcting Codes in Projective Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and Covering Properties of Subspace Codes for Error Control in Random Linear Network Coding / 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: Codes and anticodes in the Grassman graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear authentication codes: bounds and constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Johnson type bounds on constant dimension codes / rank
 
Normal rank

Latest revision as of 03:54, 13 July 2024

scientific article; zbMATH DE number 6663562
Language Label Description Also known as
English
Bounds on subspace codes based on totally isotropic subspaces in unitary spaces
scientific article; zbMATH DE number 6663562

    Statements

    Bounds on subspace codes based on totally isotropic subspaces in unitary spaces (English)
    0 references
    0 references
    0 references
    0 references
    14 December 2016
    0 references
    0 references
    subspace codes
    0 references
    bounds
    0 references
    unitary spaces
    0 references
    totally isotropic subspaces
    0 references
    Steiner structure
    0 references