On the public citation graph

Real-time delay with network coding and feedback

0 signed · 46 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1023/a:1019134607998openalex-snapshot
Broadcast scheduling for information distribution
inferredcites →https://doi.org/10.1109/18.850663openalex-snapshot
Network information flow
inferredcites →https://doi.org/10.1109/18.971747openalex-snapshot
Asymmetric multiple description lattice vector quantizers
inferredcites →https://doi.org/10.1109/79.952806openalex-snapshot
Multiple description coding: compression meets the network
inferredcites →https://doi.org/10.1109/ciss.2007.4298308openalex-snapshot
On Feedback for Network Coding
inferredcites →https://doi.org/10.1109/dcc.2000.838216openalex-snapshot
Wireless image transmission using multiple-description based concatenated codes
inferredcites →https://doi.org/10.1109/dcc18729.2011openalex-snapshot
2011 Data Compression Conference
inferredcites →https://doi.org/10.1109/focs.2006.42openalex-snapshot
Index Coding with Side Information
inferredcites →https://doi.org/10.1109/focs.2007.45openalex-snapshot
Inferring Local Homology from Sampled Stratified Spaces
inferredcites →https://doi.org/10.1109/focs.2008.41openalex-snapshot
Broadcasting with Side Information
inferredcites →https://doi.org/10.1109/infcom.1997.635120openalex-snapshot
Broadcast scheduling for information distribution
inferredcites →https://doi.org/10.1109/infcom.1998.662940openalex-snapshot
Informed-source coding-on-demand (ISCOD) over broadcast channels
inferredcites →https://doi.org/10.1109/isit.2003.1228430openalex-snapshot
Coding and scheduling for efficient loss-resilient data broadcasting
inferredcites →https://doi.org/10.1109/isit.2009.5205612openalex-snapshot
Delay with network coding and feedback
inferredcites →https://doi.org/10.1109/isit14398.2010openalex-snapshot
2010 IEEE International Symposium on Information Theory
inferredcites →https://doi.org/10.1109/ispan.2000.900298openalex-snapshot
Competitive analysis of on-line algorithms for on-demand data broadcast scheduling
inferredcites →https://doi.org/10.1109/itwitwn.2007.4318066openalex-snapshot
On queueing in coded networks ¿ queue size follows degrees of freedom
inferredcites →https://doi.org/10.1109/mcom.2004.1321395openalex-snapshot
Path diversity for enhanced media streaming
inferredcites →https://doi.org/10.1109/netcod.2008.4476183openalex-snapshot
Online Broadcasting with Network Coding
inferredcites →https://doi.org/10.1109/sfcs.2002.1181950openalex-snapshot
LT codes
inferredcites →https://doi.org/10.1109/tit.1982.1056588openalex-snapshot
Achievable rates for multiple descriptions
inferredcites →https://doi.org/10.1109/tit.2002.807285openalex-snapshot
Linear network coding
inferredcites →https://doi.org/10.1109/tit.2003.821998openalex-snapshot
>tex<$n$>/tex<-Channel Symmetric Multiple Descriptions—Part I:>tex<$(n,k)$>/tex
inferredcites →https://doi.org/10.1109/tit.2004.837189openalex-snapshot
2005 IEEE International Symposium on Information Theory
inferredcites →https://doi.org/10.1109/tit.2005.844063openalex-snapshot
$n$ -Channel Symmetric Multiple Descriptions—Part II: An Achievable Rate-Distortion Region
inferredcites →https://doi.org/10.1109/tit.2005.861858openalex-snapshot
2006 IEEE International Symposium on Information Theory
inferredcites →https://doi.org/10.1109/tit.2006.870033openalex-snapshot
2006 IEEE Information Theory Workshop
inferredcites →https://doi.org/10.1109/tit.2006.874390openalex-snapshot
Raptor codes
inferredcites →https://doi.org/10.1109/tit.2006.886462openalex-snapshot
2007 IEEE International Symposium on Information Theory
inferredcites →https://doi.org/10.1117/12.382963openalex-snapshot
Wireless image transmission using multiple-description-based concatenated codes
inferredcites →https://doi.org/10.1145/1151659.1159942openalex-snapshot
XORs in the air
inferredcites →https://doi.org/10.1145/2000807.2000815openalex-snapshot
Broadcast scheduling: Algorithms and complexity
inferredcites →https://doi.org/10.1201/9780367425517-3openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.5555/1109557.1109596openalex-snapshot
Improved approximation algorithms for broadcast scheduling

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.asoc.2017.05.033openalex-snapshot
An improved MOEA/D algorithm for multi-objective multicast routing with network coding
inferred← citeshttps://doi.org/10.1016/j.jnca.2014.09.002openalex-snapshot
A survey on network coding: From traditional wireless networks to emerging cognitive radio networks
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/access.2017.2757241openalex-snapshot
Caterpillar RLNC (CRLNC): A Practical Finite Sliding Window RLNC Approach
inferred← citeshttps://doi.org/10.1109/access.2018.2865137openalex-snapshot
Caterpillar RLNC With Feedback (CRLNC-FB): Reducing Delay in Selective Repeat ARQ Through Coding
inferred← citeshttps://doi.org/10.1109/comst.2017.2661861openalex-snapshot
Network Coding in Cognitive Radio Networks: A Comprehensive Survey
inferred← citeshttps://doi.org/10.1109/icc40277.2020.9148646openalex-snapshot
Application-Layer Coding with Intermittent Feedback Under Delay and Duty-Cycle Constraints
inferred← citeshttps://doi.org/10.1109/lcomm.2015.2449848openalex-snapshot
Opportunistic Schedulings for Random Linear Network Coding in Time Varying Channels
inferred← citeshttps://doi.org/10.1109/tii.2022.3192966openalex-snapshot
Making the Most of Sporadic Feedback: Low-Complexity Application Layer Coding for Data Recovery in the Internet of Things
inferred← citeshttps://doi.org/10.1109/tmm.2015.2425228openalex-snapshot
Adaptive Prioritized Random Linear Coding and Scheduling for Layered Data Delivery From Multiple Servers
inferred← citeshttps://doi.org/10.1186/s13638-017-0817-3openalex-snapshot
Efficient network coding solutions for limiting the effect of packet loss
inferred← citeshttps://doi.org/10.70675/1319c64cz009bz4e91za063z16ef044df152openalex-snapshot
Centralized and distributed address correlated network coding protocols
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.