Sending Perishable Information: Coding Improves Delay-Constrained Throughput Even for Single Unicast

DOI10.1109/TIT.2016.2619717MaRDI QIDQ2979098zbMATH OpenFDO

Authors Chih-Chun Wang, Minghua Chen

Publication date 2 May 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Information theory (general) (94A15) Source coding (94A29)

Recommendations

• On the Delay and Throughput Gains of Coding in Unreliable Networks
• On the Delay Advantage of Coding in Packet Erasure Networks
• Coding Improves the Throughput-Delay Tradeoff in Mobile Wireless Networks
• Towards efficient and practical network coding in delay tolerant networks
• Toward a timed theory of channel coding
• On Coding for Delay—Network Coding for Time-Division Duplexing
• Delay Asymptotics With Retransmissions and Incremental Redundancy Codes Over Erasure Channels
• Near-Optimal Rates for Limited-Delay Universal Lossy Source Coding
• Optimal Multiplexed Erasure Codes for Streaming Messages With Different Decoding Delays

Cited in

(1)

• On the Age of Information With Packet Deadlines

This page was built for publication: Sending Perishable Information: Coding Improves Delay-Constrained Throughput Even for Single Unicast

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2979098)