Application of coding theory to interconnection networks (Q1199457): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A group-theoretic model for symmetric interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit construction of exponential sized families of k-independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: How robust is the n-cube? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interconnection Networks Based on a Generalization of Cube-Connected Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering radius---Survey and recent results / rank
 
Normal rank
Property / cites work
 
Property / cites work: WOM-codes construits à partir des codes de Hamming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of \(k\)-independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two addition theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5665102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication aspects of networks based on geometric incidence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Exhaustive Pattern Generation for Logic Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalisation to noncommutative groups of a theorem of Mann / rank
 
Normal rank

Latest revision as of 15:16, 16 May 2024

scientific article
Language Label Description Also known as
English
Application of coding theory to interconnection networks
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references