Second-Order Converse for Rate-Limited Common Randomness Generation

We employ a recent technique based on a semigroup application of the method of types to improve on a second-order converse for the common randomness (CR) generation problem. The previously known bound lead to a correct second-order asymptotic rate, but incorrect sign on the second-order term for error rates below 1/2. The new bound has both the correct scaling and sign of the second-order term for small enough error rates.

[1]  Jingbo Liu.  Dispersion Bound for the Wyner-Ahlswede-Körner Network via a Semigroup Method on Types , 2021, IEEE Transactions on Information Theory.

[2]  Sergio Verdú,et al.  Secret key generation with one communicator and a one-shot converse via hypercontractivity , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[3]  Himanshu Tyagi,et al.  Strong converse for a degraded wiretap channel via active hypothesis testing , 2014, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[4]  Vincent Yan Fu Tan,et al.  Nonasymptotic and Second-Order Achievability Bounds for Coding With Side-Information , 2013, IEEE Transactions on Information Theory.

[5]  Sergio Verdú,et al.  Fixed-Length Lossy Compression in the Finite Blocklength Regime , 2011, IEEE Transactions on Information Theory.

[6]  S. Verdú,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

[7]  Masahito Hayashi,et al.  Information Spectrum Approach to Second-Order Coding Rate in Channel Coding , 2008, IEEE Transactions on Information Theory.

[8]  Amir Dembo,et al.  Large Deviations Techniques and Applications , 1998 .

[9]  I. Csiszár,et al.  Common randomness and secret key generation with a helper , 1997, Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253).

[10]  Wayne E. Stark,et al.  Cryptographic Key Agreement for Mobile Radio , 1996, Digit. Signal Process..

[11]  Rudolf Ahlswede,et al.  Common randomness in information theory and cryptography - I: Secret sharing , 1993, IEEE Trans. Inf. Theory.

[12]  Ueli Maurer,et al.  Secret key agreement by public discussion from common information , 1993, IEEE Trans. Inf. Theory.

[13]  Jingbo Liu,et al.  Information Theory from A Functional Viewpoint , 2018 .

[14]  H. Vincent Poor,et al.  Channel coding: non-asymptotic fundamental limits , 2010 .

[15]  V. Strassen,et al.  Asymptotic Estimates in Shannon ’ s Information Theory , 2009 .

[16]  Rudolf Ahlswede,et al.  Common Randomness in Information Theory and Cryptography - Part II: CR Capacity , 1998, IEEE Trans. Inf. Theory.