Optimum distance flag codes from spreads via perfect matchings in graphs (Q825551): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3216953947 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2005.09370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network information flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flag codes from planar spreads in network coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equidistant codes in the Grassmannian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Matchings in $O(n\log n)$ Time in Regular Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebraic approach for decoding spread codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial spreads in random network coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equidistant subspace codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Distinct Representatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / 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: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for flag codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Field reduction and linear sets in finite geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4301239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network coding with flags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spread decoding in extension fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Teoria di Galois, fibrazioni proiettive e geometrie non desarguesiane / rank
 
Normal rank

Latest revision as of 13:35, 27 July 2024

scientific article
Language Label Description Also known as
English
Optimum distance flag codes from spreads via perfect matchings in graphs
scientific article

    Statements

    Optimum distance flag codes from spreads via perfect matchings in graphs (English)
    0 references
    17 December 2021
    0 references
    network coding
    0 references
    subspace codes
    0 references
    spreads
    0 references
    flag codes
    0 references
    graphs
    0 references
    perfect matching
    0 references
    maximum distance
    0 references

    Identifiers

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