A digital fountain approach to reliable distribution of bulk data
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Error Control Coding, Second Edition
Error Control Coding, Second Edition
Efficient and flexible parallel retrieval using priority encoded transmission
NOSSDAV '04 Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video
Loss-resilient on-demand media streaming using priority encoding
Proceedings of the 12th annual ACM international conference on Multimedia
Network coding: an instant primer
ACM SIGCOMM Computer Communication Review
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Minimum-cost multicast over coded packet networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Network coding theory: single sources
Communications and Information Theory
Efficient operation of coded packet networks
Efficient operation of coded packet networks
Unveiling turbo codes: some results on parallel concatenated coding schemes
IEEE Transactions on Information Theory
Priority encoding transmission
IEEE Transactions on Information Theory - Part 1
Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding
IEEE Transactions on Information Theory
Comments on broadcast channels
IEEE Transactions on Information Theory
Good error-correcting codes based on very sparse matrices
IEEE Transactions on Information Theory
About priority encoding transmission
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Improved low-density parity-check codes using irregular graphs
IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Communication over fading channels with delay constraints
IEEE Transactions on Information Theory
Extrinsic information transfer functions: model and erasure channel properties
IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast
IEEE Transactions on Information Theory
A Rank-Metric Approach to Error Control in Random Network Coding
IEEE Transactions on Information Theory
Hi-index | 754.84 |
Via multiterminal information theory, a framework is presented for deriving fundamental rate-delay tradeoffs that delay mitigating codes must have when utilized over multipath routed and random linear network coded networks. The rate-delay tradeoff is formulated as a calculus problem on a capacity region of a related abstracted broadcast channel. Given this general framework for studying such rate-delay tradeoffs, the extreme case of uniform networks, in which each possible received packet arrival order is equally likely, is considered. For these networks, the rate-delay calculus problem is simplified to an integer programming problem, which for small numbers of packets may be solved explicitly, or for larger numbers of packets, may be accurately approximated through the calculus of variations by appropriate relaxation of an integer constraint. Explicit expressions for the rate-delay tradeoff in uniform networks are presented in the special cases of i) constant packet interarrival times, and ii) exponential independent and identically distributed (i.i.d.) packet arrival times. Finally, the delay mitigating codes achieving these rate-delay tradeoffs are discussed.