On the public citation graph
Fault-tolerant cube graphs and coding theory
0 signed · 22 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jpdc.1995.1032openalex-snapshot
On the Construction of Fault-Tolerant Cube-Connected Cycles Networks
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1049/ip-e.1991.0054openalex-snapshot
Simulation of PM21 network by folded hypercube
inferredcites →https://doi.org/10.1109/12.241598openalex-snapshot
Fault-tolerant meshes and hypercubes with minimal numbers of spares
inferredcites →https://doi.org/10.1109/12.256455openalex-snapshot
An observation on the bisectional interconnection networks
inferredcites →https://doi.org/10.1109/12.35837openalex-snapshot
Bisectional fault-tolerant communication architecture for supercomputer systems
inferredcites →https://doi.org/10.1109/12.367998openalex-snapshot
Wildcard dimensions, coding theory and fault-tolerant meshes and hypercubes
inferredcites →https://doi.org/10.1109/18.212301openalex-snapshot
An updated table of minimum-distance bounds for binary linear codes
inferredcites →https://doi.org/10.1109/71.298202openalex-snapshot
Adding multiple-fault tolerance to generalized cube networks
inferredcites →https://doi.org/10.1109/spdp.1991.218267openalex-snapshot
Fault-tolerant meshes with minimal numbers of spares
inferredcites →https://doi.org/10.1109/tc.1982.1676021openalex-snapshot
The Extra Stage Cube: A Fault-Tolerant Interconnection Network for Supersystems
inferredcites →https://doi.org/10.1109/tit.1987.1057356openalex-snapshot
An updated table of minimum-distance bounds for binary linear codes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11432-011-4357-xopenalex-snapshot
High-yield performance-efficient redundancy analysis for 2D memory
inferred← citeshttps://doi.org/10.1049/el:19970727openalex-snapshot
Constructions of link-fault-tolerant q -ary k -cube networks
inferred← citeshttps://doi.org/10.1049/iet-com.2014.0616openalex-snapshot
Joint sparse graph over GF( q ) for code division multiple access systems
inferred← citeshttps://doi.org/10.1109/12.869334openalex-snapshot
Tolerating multiple faults in multistage interconnection networks with minimal extra stages
inferred← citeshttps://doi.org/10.1109/ats.2010.48openalex-snapshot
HYPERA: High-Yield Performance-Efficient Redundancy Analysis
inferred← citeshttps://doi.org/10.1109/ispan.1996.509018openalex-snapshot
Fault-tolerant graphs for tori
inferred← citeshttps://doi.org/10.1109/tc.2002.1004594openalex-snapshot
Fault-tolerant meshes with small degree
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3849497/v1openalex-snapshot
On Duplication-Free Codes for Disjoint or Equal-Length Errors
inferred← citeshttps://doi.org/10.48550/arxiv.1703.08109openalex-snapshot
Cayley graphs and symmetric interconnection networks
inferred← citeshttps://doi.org/10.7907/r15b-vd58.openalex-snapshot
Fault-tolerant cluster of networking elements
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.