Kaspi Problem Revisited: Non-Asymptotic Converse Bound and Second-Order Asymptotics
暂无分享,去创建一个
[1] Tsachy Weissman,et al. Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff , 2015, IEEE Transactions on Information Theory.
[2] Amiram H. Kaspi,et al. Rate-distortion function when side-information may be present at the decoder , 1994, IEEE Trans. Inf. Theory.
[3] E. Telatar,et al. The Kaspi Rate-Distortion Problem with Encoder Side-Information: Binary Erasure Case , 2006 .
[4] Mehul Motani,et al. Second-Order and Moderate Deviations Asymptotics for Successive Refinement , 2016, IEEE Transactions on Information Theory.
[5] Ertem Tuncel,et al. The rate-distortion function for successive refinement of abstract sources , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).
[6] H. Vincent Poor,et al. Channel coding: non-asymptotic fundamental limits , 2010 .
[7] Kenneth Rose,et al. Computation and analysis of the N-Layer scalable rate-distortion function , 2003, IEEE Trans. Inf. Theory.
[8] Amin Gohari,et al. A technique for deriving one-shot achievability results in network information theory , 2013, 2013 IEEE International Symposium on Information Theory.
[9] Mehul Motani,et al. Second-Order Coding Rates for Conditional Rate-Distortion , 2014, ArXiv.
[10] Mehul Motani,et al. Discrete Lossy Gray–Wyner Revisited: Second-Order Asymptotics, Large and Moderate Deviations , 2015, IEEE Transactions on Information Theory.
[11] Masahito Hayashi,et al. Information Spectrum Approach to Second-Order Coding Rate in Channel Coding , 2008, IEEE Transactions on Information Theory.
[12] Shun Watanabe,et al. Second-Order Region for Gray–Wyner Network , 2015, IEEE Transactions on Information Theory.
[13] Vincent Yan Fu Tan,et al. Nonasymptotic and Second-Order Achievability Bounds for Coding With Side-Information , 2013, IEEE Transactions on Information Theory.
[14] Suhas N. Diggavi,et al. Lossy source coding with Gaussian or erased side-information , 2009, 2009 IEEE International Symposium on Information Theory.
[15] Robert M. Gray,et al. Source coding for a simple network , 1974 .
[16] Victoria Kostina,et al. Lossy data compression: Nonasymptotic fundamental limits , 2013 .
[17] Yuval Kochman,et al. The Dispersion of Lossy Source Coding , 2011, 2011 Data Compression Conference.
[18] Masahito Hayashi,et al. Second-Order Asymptotics in Fixed-Length Source Coding and Intrinsic Randomness , 2005, IEEE Transactions on Information Theory.
[19] Mehul Motani,et al. Non-Asymptotic Converse Bounds and Refined Asymptotics for Two Lossy Source Coding Problems , 2017, ArXiv.
[20] E. Telatar,et al. The Kaspi Rate-Distortion Problem with Encoder Side-Information: Gaussian Case , 2005 .
[21] Sergio Verdú,et al. A new converse in rate-distortion theory , 2012, 2012 46th Annual Conference on Information Sciences and Systems (CISS).
[22] Sergio Verdú,et al. Fixed-Length Lossy Compression in the Finite Blocklength Regime , 2011, IEEE Transactions on Information Theory.