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

DOI10.1109/TIT.2016.2619717zbMATH Open1359.94464MaRDI QIDQ2979098

Minghua Chen, Chih-Chun Wang

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

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

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)