Backlog-adaptive compression: Age of information
暂无分享,去创建一个
[1] Sergio Verdú,et al. Optimal Lossless Data Compression: Non-Asymptotics and Asymptotics , 2014, IEEE Transactions on Information Theory.
[2] Anant Sahai,et al. The error exponent with delay for lossless source coding , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Punta del Este.
[3] Anthony Ephremides,et al. Age of information under random updates , 2013, 2013 IEEE International Symposium on Information Theory.
[4] Roy D. Yates,et al. Update or wait: How to keep your data fresh , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.
[5] Roy D. Yates,et al. Timeliness in Lossless Block Coding , 2016, 2016 Data Compression Conference (DCC).
[6] Eytan Modiano,et al. Optimizing age-of-information in a multi-class queueing system , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).
[7] Michael B. Baer. Source Coding for Quasiarithmetic Penalties , 2006, IEEE Transactions on Information Theory.
[8] Roy D. Yates,et al. Real-time status: How often should one update? , 2012, 2012 Proceedings IEEE INFOCOM.