On the public citation graph
Round-robin streaming with generations
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.1109/iwqos.2006.250480openalex-snapshot
How Practical is Network Coding?
inferredcites →https://doi.org/10.1109/tit.2006.881746openalex-snapshot
A Random Linear Network Coding Approach to Multicast
inferredcites →https://doi.org/10.1109/tit.2010.2095111openalex-snapshot
Effects of the Generation Size and Overlap on Throughput and Complexity in Randomized Linear Network Coding
inferredcites →https://doi.org/10.1137/s089548010139388xopenalex-snapshot
Random Krylov Spaces over Finite Fields
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2015.06.003openalex-snapshot
Systematic rateless erasure code for short messages transmission
inferred← citeshttps://doi.org/10.1109/access.2017.2736879openalex-snapshot
PACE: Redundancy Engineering in RLNC for Low-Latency Communication
inferred← citeshttps://doi.org/10.1109/acssc.2013.6810676openalex-snapshot
Delay-optimal streaming codes under source-channel rate mismatch
inferred← citeshttps://doi.org/10.1109/glocomw.2016.7848908openalex-snapshot
Feedback-Assisted Random Linear Network Coding in Wireless Broadcast
inferred← citeshttps://doi.org/10.1109/isit.2013.6620377openalex-snapshot
Robust streaming erasure codes based on deterministic channel approximations
inferred← citeshttps://doi.org/10.1109/isit.2013.6620725openalex-snapshot
Round-robin overlapping generations coding for fast content download
inferred← citeshttps://doi.org/10.1109/isit.2017.8006806openalex-snapshot
Multiplexed FEC for multiple streams with different playout deadlines
inferred← citeshttps://doi.org/10.1109/itw.2014.6970889openalex-snapshot
On deterministic linear network coded broadcast and its relation to matroid theory
inferred← citeshttps://doi.org/10.1109/lcomm.2015.2432106openalex-snapshot
Link Layer Systematic Random Network Coding for DVB-S2X/RCS
inferred← citeshttps://doi.org/10.1109/tcomm.2014.2364198openalex-snapshot
From Instantly Decodable to Random Linear Network Coded Broadcast
inferred← citeshttps://doi.org/10.1109/tit.2016.2618924openalex-snapshot
Layered Constructions for Low-Delay Streaming Codes
inferred← citeshttps://doi.org/10.1109/tit.2018.2827367openalex-snapshot
Multiplexed Coding for Multiple Streams With Different Decoding Delays
inferred← citeshttps://doi.org/10.1631/fitee.1601361openalex-snapshot
Performance analysis and optimization for chunked network coding based wireless cooperative downloading systems
inferred← citeshttps://doi.org/10.3837/tiis.2013.04.011openalex-snapshot
Optimizing the Joint Source/Network Coding for Video Streaming over Multi-hop Wireless Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1506.01150openalex-snapshot
The Benefit of Limited Feedback to Generation-Based Random Linear Network Coding in Wireless Broadcast
inferred← citeshttps://doi.org/10.48550/arxiv.1805.05783openalex-snapshot
Optimal Finite Length Coding Rate of Random Linear Network Coding Schemes
inferred← citeshttps://doi.org/10.7282/t33f4nd8openalex-snapshot
Content networking with packet-level coding
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.