On the public citation graph
Layered Constructions for Low-Delay Streaming Codes
0 signed · 145 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.1002/9781119098799.fmatteropenalex-snapshot
Fundamentals of Convolutional Coding
inferredcites →https://doi.org/10.1002/j.1538-7305.1960.tb03959.xopenalex-snapshot
Capacity of a Burst-Noise Channel
inferredcites →https://doi.org/10.1002/j.1538-7305.1979.tb02263.xopenalex-snapshot
On the Structure of Real-Time Source Coders
inferredcites →https://doi.org/10.1109/18.556671openalex-snapshot
Coding for interactive communication
inferredcites →https://doi.org/10.1109/9780470544693openalex-snapshot
Fundamentals of Convolutional Coding
inferredcites →https://doi.org/10.1109/acssc.2011.6189949openalex-snapshot
Correcting erasure bursts with minimum decoding delay
inferredcites →https://doi.org/10.1109/acssc.2013.6810676openalex-snapshot
Delay-optimal streaming codes under source-channel rate mismatch
inferredcites →https://doi.org/10.1109/allerton.2009.5394508openalex-snapshot
Rateless codes for single-server streaming to diverse users
inferredcites →https://doi.org/10.1109/allerton.2010.5706932openalex-snapshot
Multicast streaming codes (Mu-SCo) for burst erasure channels
inferredcites →https://doi.org/10.1109/cwit.2011.5872144openalex-snapshot
Streaming codes for a double-link burst erasure channel
inferredcites →https://doi.org/10.1109/cwit.2013.6621612openalex-snapshot
Robust streaming erasure codes using MDS constituent codes
inferredcites →https://doi.org/10.1109/glocom.2010.5683838openalex-snapshot
Diversity Embedded Streaming Erasure Codes (DE-SCo): Constructions and Optimality
inferredcites →https://doi.org/10.1109/infcom.2013.6567095openalex-snapshot
Streaming codes for channels with burst and isolated erasures
inferredcites →https://doi.org/10.1109/isit.1995.550439openalex-snapshot
Coding for interactive communication
inferredcites →https://doi.org/10.1109/isit.2007.4557355openalex-snapshot
Delay-Optimal Burst Erasure Code Construction
inferredcites →https://doi.org/10.1109/isit.2009.5205380openalex-snapshot
On multicasting with streaming burst-erasure codes
inferredcites →https://doi.org/10.1109/isit.2011.6033847openalex-snapshot
Linear error correcting codes with anytime reliability
inferredcites →https://doi.org/10.1109/isit.2012.6284046openalex-snapshot
On playback delay in streaming communication
inferredcites →https://doi.org/10.1109/isit.2012.6284055openalex-snapshot
Erasure coding for real-time streaming
inferredcites →https://doi.org/10.1109/isit.2013.6620179openalex-snapshot
Dynamic joint source-Channel coding with feedback
inferredcites →https://doi.org/10.1109/isit.2013.6620377openalex-snapshot
Robust streaming erasure codes based on deterministic channel approximations
inferredcites →https://doi.org/10.1109/isit.2013.6620379openalex-snapshot
On coding for real-time streaming under packet erasures
inferredcites →https://doi.org/10.1109/ita.2012.6181798openalex-snapshot
On erasure correction coding for streaming
inferredcites →https://doi.org/10.1109/jsac.2009.090609openalex-snapshot
Doped fountain coding for minimum delay data collection in circular networks
inferredcites →https://doi.org/10.1109/jsac.2011.111213openalex-snapshot
A Multi-Burst Transmission Strategy for Streaming Over Blockage Channels with Long Feedback Delay
inferredcites →https://doi.org/10.1109/jstsp.2014.2388191openalex-snapshot
Streaming Codes With Partial Recovery Over Channels With Burst and Isolated Erasures
inferredcites →https://doi.org/10.1109/mnet.2010.5430143openalex-snapshot
Could Skype be more satisfying? a QoE-centric study of the FEC mechanism in an internet-scale VoIP system
inferredcites →https://doi.org/10.1109/netcod.2012.6261899openalex-snapshot
Round-robin streaming with generations
inferredcites →https://doi.org/10.1109/tit.1967.1053975openalex-snapshot
A binary channel characterization using partitioned Markov chains
inferredcites →https://doi.org/10.1109/tit.1970.1054541openalex-snapshot
Convolutional codes I: Algebraic structure
inferredcites →https://doi.org/10.1109/tit.2004.834844openalex-snapshot
Burst Erasure Correction Codes With Low Decoding Delay
inferredcites →https://doi.org/10.1109/tit.2005.862100openalex-snapshot
Strongly-MDS convolutional codes
inferredcites →https://doi.org/10.1109/tit.2006.880067openalex-snapshot
On the Structure of Optimal Real-Time Encoders and Decoders in Noisy Communication
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.2015.2445753openalex-snapshot
Streaming Codes for Multicast Over Burst Erasure Channels
inferredcites →https://doi.org/10.1109/tmm.2011.2153193openalex-snapshot
Optimizing FEC Transmission Strategy for Minimizing Delay in Lossless Sequential Streaming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-20005-3_19openalex-snapshot
A Novel Construction for Streaming Networks with Delays
inferred← citeshttps://doi.org/10.1007/978-3-031-81724-3_50openalex-snapshot
A Construction of an MRD $$(5 \times 5, 1, 19)$$ Rank Metric Convolutional Code
inferred← citeshttps://doi.org/10.1007/978-3-319-66278-7_21openalex-snapshot
Column Rank Distances of Rank Metric Convolutional Codes
inferred← citeshttps://doi.org/10.1007/978-3-319-70293-3_5openalex-snapshot
Multi-shot Network Coding
inferred← citeshttps://doi.org/10.1007/s10623-017-0346-4openalex-snapshot
Concatenation of convolutional codes and rank metric codes for multi-shot network coding
inferred← citeshttps://doi.org/10.1007/s10623-020-00808-wopenalex-snapshot
A new rank metric for convolutional codes
inferred← citeshttps://doi.org/10.1007/s13398-019-00744-yopenalex-snapshot
Block Toeplitz matrices for burst-correcting convolutional codes
inferred← citeshttps://doi.org/10.1016/j.csi.2022.103709openalex-snapshot
Packet loss concealment method based on interpolation in packet voice coding
inferred← citeshttps://doi.org/10.1016/j.ffa.2021.101815openalex-snapshot
List decoding of convolutional codes over integer residue rings
inferred← citeshttps://doi.org/10.1080/03081087.2023.2169232openalex-snapshot
Weighted Reed–Solomon convolutional codes
inferred← citeshttps://doi.org/10.1109/allerton.2018.8635971openalex-snapshot
Streaming Codes For Variable-Size Arrivals
inferred← citeshttps://doi.org/10.1109/bsc.2018.8494693openalex-snapshot
Streaming Codes with Unequal Error Protection against Burst Losses
inferred← citeshttps://doi.org/10.1109/glocomw.2016.7848942openalex-snapshot
Joint FEC across Multiple Streams with Different Playout Deadlines
inferred← citeshttps://doi.org/10.1109/icassp49357.2023.10095948openalex-snapshot
Codes Correcting Burst and Arbitrary Erasures for Reliable and Low-Latency Communication
inferred← citeshttps://doi.org/10.1109/icc59461.2026.11588135openalex-snapshot
Analysis on Random Linear Streaming Codes in the Gilbert-Elliott Channel
inferred← citeshttps://doi.org/10.1109/icccbda64898.2025.11030515openalex-snapshot
Optimal-Rate Streaming Code in the Three-Node Relay Network
inferred← citeshttps://doi.org/10.1109/infocom.2017.8057027openalex-snapshot
FEC for VoIP using dual-delay streaming codes
inferred← citeshttps://doi.org/10.1109/isit.2015.7282860openalex-snapshot
Convolutional codes with maximum column sum rank for network streaming
inferred← citeshttps://doi.org/10.1109/isit.2015.7282861openalex-snapshot
Embedded MDS codes for multicast streaming
inferred← citeshttps://doi.org/10.1109/isit.2016.7541829openalex-snapshot
Low delay network streaming under burst losses
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/isit.2018.8437570openalex-snapshot
Rate-Optimal Streaming Codes for Channels with Burst and Isolated Erasures
inferred← citeshttps://doi.org/10.1109/isit.2018.8437832openalex-snapshot
Optimal Streaming Codes for Channels With Burst and Arbitrary Erasures
inferred← citeshttps://doi.org/10.1109/isit.2019.8849250openalex-snapshot
Optimal Multiplexed Erasure Codes for Streaming Messages With Different Decoding Delays
inferred← citeshttps://doi.org/10.1109/isit.2019.8849603openalex-snapshot
A Quadratic Field-Size Rate-Optimal Streaming Code for Channels with Burst and Random Erasures
inferred← citeshttps://doi.org/10.1109/isit.2019.8849743openalex-snapshot
State Estimation via Worst-Case Erasure and Symmetric Channels with Memory
inferred← citeshttps://doi.org/10.1109/isit.2019.8849846openalex-snapshot
Optimal Streaming Erasure Codes Over the Three-Node Relay Network
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174038openalex-snapshot
Error Rate Analysis for Random Linear Streaming Codes in the Finite Memory Length Regime
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174218openalex-snapshot
Staggered Diagonal Embedding Based Linear Field Size Streaming Codes
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174225openalex-snapshot
Streaming Erasure Codes over Multi-hop Relay Network
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174235openalex-snapshot
Delay-Optimal Coding for Secure Transmission over Parallel Burst Erasure Channels with an Eavesdropper
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174458openalex-snapshot
Online Versus Offline Rate in Streaming Codes for Variable-Size Messages
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518162openalex-snapshot
Random Linear Streaming Codes in the Finite Memory Length and Decoding Deadline Regime
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518179openalex-snapshot
Explicit Rate-Optimal Streaming Codes with Smaller Field Size
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518192openalex-snapshot
Streaming Erasure Codes over Multi-Access Relay Networks
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518228openalex-snapshot
Generalized Simple Streaming Codes from MDS Codes
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834539openalex-snapshot
Learning-Augmented Streaming Codes are Approximately Optimal for Variable-Size Messages
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834645openalex-snapshot
Rate-Optimal Streaming Codes Over the Three-Node Decode-And-Forward Relay Network
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834704openalex-snapshot
On State-Dependent Streaming Erasure Codes over the Three-Node Relay Network
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834842openalex-snapshot
On Information-Debt-Optimal Streaming Codes With Small Memory
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206546openalex-snapshot
Rate-Optimal Streaming Codes over Small Finite Fields for Burst/Random Erasure Channels
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206559openalex-snapshot
Learning-augmented streaming codes for variable-size messages under partial burst losses
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206577openalex-snapshot
Streaming Erasure Codes over Multicast Relayed Networks
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206858openalex-snapshot
Explicit Information-Debt-Optimal Streaming Codes With Small Memory
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206862openalex-snapshot
Near-Optimal Streaming Codes with Linear Field Size
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206973openalex-snapshot
Detailed Asymptotics of the Delay-Reliability Tradeoff of Random Linear Streaming Codes
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619218openalex-snapshot
Streaming Codes for Three-Node Relay Networks with Burst Erasures
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619263openalex-snapshot
On Streaming Codes for Simultaneously Correcting Burst and Random Erasures
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619534openalex-snapshot
On Streaming Codes for Burst and Random Errors
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619539openalex-snapshot
Subset Adaptive Relaying for Streaming Erasure Codes
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11653862openalex-snapshot
On the Analysis and Optimization of Low-latency Scalable Video Streams with Random Linear Streaming Codes
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11654034openalex-snapshot
Adaptive Streaming Codes for Three-Node Relay Networks under Burst Erasure Channels
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195247openalex-snapshot
Binary Rate-Optimal Streaming Codes with Minimal Code Length
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195476openalex-snapshot
Streaming Codes for Multi-Hop Relay Networks with Burst Erasures
inferred← citeshttps://doi.org/10.1109/itw44776.2019.8988926openalex-snapshot
An Explicit Construction of Optimal Streaming Codes for Channels With Burst and Arbitrary Erasures
inferred← citeshttps://doi.org/10.1109/itw44776.2019.8989375openalex-snapshot
An Explicit Rate-Optimal Streaming Code for Channels With Burst and Arbitrary Erasures
inferred← citeshttps://doi.org/10.1109/itw48936.2021.9611442openalex-snapshot
Streaming Codes for Handling a Combination of Burst and Random Erasures
inferred← citeshttps://doi.org/10.1109/itw48936.2021.9611448openalex-snapshot
On the Performance Analysis of Streaming Codes over the Gilbert-Elliott Channel
inferred← citeshttps://doi.org/10.1109/itw48936.2021.9611509openalex-snapshot
Locally Recoverable Streaming Codes for Packet-Erasure Recovery
inferred← citeshttps://doi.org/10.1109/itw54588.2022.9965940openalex-snapshot
Rate-Optimal Streaming Codes with Smaller Field Size Under Less-Stringent Decoding-Delay Requirements
inferred← citeshttps://doi.org/10.1109/itw55543.2023.10161647openalex-snapshot
Coding Gain for Age of Information in a Multi-source System with Erasure Channel
inferred← citeshttps://doi.org/10.1109/jsait.2021.3104970openalex-snapshot
Coded Sequential Matrix Multiplication for Straggler Mitigation
inferred← citeshttps://doi.org/10.1109/jsait.2021.3126687openalex-snapshot
On Streaming Codes With Unequal Error Protection
inferred← citeshttps://doi.org/10.1109/jstsp.2014.2388191openalex-snapshot
Streaming Codes With Partial Recovery Over Channels With Burst and Isolated Erasures
inferred← citeshttps://doi.org/10.1109/lcomm.2019.2934684openalex-snapshot
Cross-Packet Coding for Delay-Constrained Streaming Applications
inferred← citeshttps://doi.org/10.1109/lcomm.2019.2956500openalex-snapshot
Simple Streaming Codes for Reliable, Low-Latency Communication
inferred← citeshttps://doi.org/10.1109/lcomm.2020.2989367openalex-snapshot
On Streaming Coding for Low-Latency Packet Transmissions Over Highly Lossy Links
inferred← citeshttps://doi.org/10.1109/lcomm.2025.3633508openalex-snapshot
Rate-Optimal Streaming Codes Over Three-Node Relay Networks With Burst Erasures
inferred← citeshttps://doi.org/10.1109/msp.2016.2639062openalex-snapshot
Perfecting Protection for Interactive Multimedia: A survey of forward error correction for low-delay interactive applications
inferred← citeshttps://doi.org/10.1109/ncc60321.2024.10486004openalex-snapshot
On Multi-Path Streaming Codes
inferred← citeshttps://doi.org/10.1109/noms59830.2024.10575194openalex-snapshot
An Efficient FEC Scheme with SLA Consideration for Low Latency Transmissions
inferred← citeshttps://doi.org/10.1109/tac.2021.3120674openalex-snapshot
Bounded Estimation Over Finite-State Channels: Relating Topological Entropy and Zero-Error Capacity
inferred← citeshttps://doi.org/10.1109/tcomm.2020.3041254openalex-snapshot
Systematic Memory MDS Sliding Window Codes Over Erasure Channels
inferred← citeshttps://doi.org/10.1109/tcomm.2023.3258487openalex-snapshot
Deep Reinforcement Learning for Latency-Sensitive Communication With Adaptive Redundant Retransmissions
inferred← citeshttps://doi.org/10.1109/tcomm.2024.3392785openalex-snapshot
Multiplexed Streaming Codes for Multi-Hop Multi-Link Communication Networks
inferred← citeshttps://doi.org/10.1109/tcomm.2024.3492098openalex-snapshot
Multiplexed Streaming Codes for Messages With Different Decoding Delays in Channel With Burst and Random Erasures
inferred← citeshttps://doi.org/10.1109/tit.2015.2445753openalex-snapshot
Streaming Codes for Multicast Over Burst Erasure Channels
inferred← citeshttps://doi.org/10.1109/tit.2016.2555949openalex-snapshot
Convolutional Codes With Maximum Column Sum Rank for Network Streaming
inferred← citeshttps://doi.org/10.1109/tit.2017.2779851openalex-snapshot
Streaming Codes for Multiplicative-Matrix Channels With Burst Rank Loss
inferred← citeshttps://doi.org/10.1109/tit.2018.2827367openalex-snapshot
Multiplexed Coding for Multiple Streams With Different Decoding Delays
inferred← citeshttps://doi.org/10.1109/tit.2020.2983152openalex-snapshot
Rate-Optimal Streaming Codes for Channels With Burst and Random Erasures
inferred← citeshttps://doi.org/10.1109/tit.2020.2999987openalex-snapshot
Generalized Column Distances
inferred← citeshttps://doi.org/10.1109/tit.2022.3170895openalex-snapshot
Streaming Codes for Variable-Size Messages
inferred← citeshttps://doi.org/10.1109/tit.2022.3178036openalex-snapshot
Random Linear Streaming Codes in the Finite Memory Length and Decoding Deadline Regime—Part I: Exact Analysis
inferred← citeshttps://doi.org/10.1109/tit.2022.3179029openalex-snapshot
Zero-Error Feedback Capacity for Bounded Stabilization and Finite-State Additive Noise Channels
inferred← citeshttps://doi.org/10.1109/tit.2022.3187669openalex-snapshot
State-Dependent Symbol-Wise Decode and Forward Codes Over Multihop Relay Networks
inferred← citeshttps://doi.org/10.1109/tit.2022.3214165openalex-snapshot
Streaming Erasure Codes Over Multi-Access Relayed Networks
inferred← citeshttps://doi.org/10.1109/tit.2023.3236425openalex-snapshot
A Construction of Maximum Distance Profile Convolutional Codes With Small Alphabet Sizes
inferred← citeshttps://doi.org/10.1109/tit.2023.3244799openalex-snapshot
Online Versus Offline Rate in Streaming Codes for Variable-Size Messages
inferred← citeshttps://doi.org/10.1109/tit.2023.3254464openalex-snapshot
Adaptive Relaying for Streaming Erasure Codes in a Three Node Relay Network
inferred← citeshttps://doi.org/10.1109/tit.2023.3328812openalex-snapshot
Explicit Rate-Optimal Streaming Codes With Smaller Field Size
inferred← citeshttps://doi.org/10.1109/tit.2024.3504538openalex-snapshot
Streaming Codes for Three-Node Relay Networks With Burst Erasures
inferred← citeshttps://doi.org/10.1109/tit.2025.3539914openalex-snapshot
New Bounds for Generalized Column Distances and Construction of Convolutional Codes
inferred← citeshttps://doi.org/10.1109/tit.2025.3619497openalex-snapshot
Random Linear Streaming Codes Analyses—Part II: Asymptotics
inferred← citeshttps://doi.org/10.1109/tit.2025.3625846openalex-snapshot
Small Field Size Streaming Code Constructions
inferred← citeshttps://doi.org/10.1109/tit.2026.3681183openalex-snapshot
Sliding Finite Window Codes: Near-Optimality and Q-Learning for Zero-Delay Coding
inferred← citeshttps://doi.org/10.1109/ton.2026.3704596openalex-snapshot
Non-Conserved Flow Control for Erasure Coding-Based Network Communications
inferred← citeshttps://doi.org/10.1109/wcnc.2019.8885583openalex-snapshot
Delay Optimal Coding for Secure Transmission over a Burst Erasure Wiretap Channel
inferred← citeshttps://doi.org/10.1137/18m1235703openalex-snapshot
Efficient Error-Correcting Codes for Sliding Windows
inferred← citeshttps://doi.org/10.1145/3589334.3645639openalex-snapshot
SatGuard: Concealing Endless and Bursty Packet Losses in LEO Satellite Networks for Delay-Sensitive Web Applications
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2383440/v1openalex-snapshot
Enhanced forward error correction scheme in ACELP based codec for voice over IP network services
inferred← citeshttps://doi.org/10.48550/arxiv.1506.03792openalex-snapshot
Convolutional Codes with Maximum Column Sum Rank for Network Streaming
inferred← citeshttps://doi.org/10.48550/arxiv.1804.08955openalex-snapshot
A new class of convolutional codes and its use in the McEliece Cryptosystem
inferred← citeshttps://doi.org/10.48550/arxiv.1902.00726openalex-snapshot
State Estimation over Worst-Case Erasure and Symmetric Channels with Memory
inferred← citeshttps://doi.org/10.48550/arxiv.1903.06210openalex-snapshot
Low Field-size, Rate-Optimal Streaming Codes for Channels With Burst and Random Erasures
inferred← citeshttps://doi.org/10.48550/arxiv.1911.01316openalex-snapshot
Robust low-delay Streaming PIR using convolutional codes
inferred← citeshttps://doi.org/10.48550/arxiv.2003.11954openalex-snapshot
Bounded State Estimation over Finite-State Channels: Relating Topological Entropy and Zero-Error Capacity
inferred← citeshttps://doi.org/10.48550/arxiv.2006.03045openalex-snapshot
Online Versus Offline Rate in Streaming Codes for Variable-Size Messages
inferred← citeshttps://doi.org/10.48550/arxiv.2010.00343openalex-snapshot
Bringing Network Coding into SDN: A Case-study for Highly Meshed Heterogeneous Communications
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.