Fetching the paper…
Reading the bibliography…
The conventional channel resolvability refers to the minimum rate needed for an input process to approximate the channel output distribution in total variation distance.
San-Fransisco: Holden-Day, 1964, originally published in Russian in 1960
M. S. Pinsker, Information and Information Stability of Random Variables and Processes · 1960
Earlier work this paper cites.
A. Rényi, “On measures of entropy and information,” in Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability
1961
Earlier work this paper cites.
I. Csiszár, “Information-type measures of difference of probability distributions and indirect observation,” Studia Sci. Math. Hungar
1967
Earlier work this paper cites.
G. Forney, “Exponential error bounds for erasure, list, and decision feedback schemes,” IEEE Transactions on Information Theory
1968
Earlier work this paper cites.
A. D. Wyner, “The common information of two dependent random variables,” IEEE Transactions on Information Theory
1975
Earlier work this paper cites.
A. D. Wyner, “The wire-tap channel,” The Bell System Technical Journal
1975
Earlier work this paper cites.
J. K. Omura, “A lower bounding method for channel and source coding probabilities,” Information and Control
1975
Earlier work this paper cites.
Cambridge University Press, 1981
I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems · 1981
Earlier work this paper cites.
A. El Gamal and E. C. van der Meulen, “A proof of Marton’s coding theorem for the discrete memoryless broadcast channel.,” IEEE Transactions on Information Theory
1981
Earlier work this paper cites.
R. Ahlswede and G. Dueck, “Identification via channels,” IEEE Transactions on Information Theory
1989
Earlier work this paper cites.
T. S. Han and S. Verdú, “New results in the theory of identification via channels,” IEEE Transactions on Information Theory
1992
Earlier work this paper cites.
T. Han and S. Verdú, “Approximation theory of output statistics,” IEEE Transactions on Information Theory
1993
Earlier work this paper cites.
Y. Steinberg and S. Verdú, “Channel simulation and coding with side information,” IEEE Transactions on Information Theory
1994
Earlier work this paper cites.
S. Verdú and T. S. Han, “A general formula for channel capacity,” IEEE Transactions on Information Theory
1994
Earlier work this paper cites.
Y. Steinberg and S. Verdú, “Simulation of random processes and rate-distortion theory,” IEEE Transactions on Information Theory
1996
Earlier work this paper cites.
I. Csiszár, “Almost independence and secrecy capacity,” Problems Inf. Transmission
1996
Earlier work this paper cites.
S. Shamai and S. Verdú, “The empirical distribution of good codes,” IEEE Transactions on Information Theory
1997
Earlier work this paper cites.
A. Orlitsky and J. R. Roche, “Coding for computing,” IEEE Transactions on Information Theory
2001
Earlier work this paper cites.
Prentice Hall, Upper Saddle River, NJ, 5 ed., 2003
J. C. Hull, Options, Futures, and Other Derivatives · 2003
Earlier work this paper cites.
Springer, 2003
T. S. Han, Information-Spectrum Methods in Information Theory · 2003
Earlier work this paper cites.
R. Renner and S. Wolf, “Simple and tight bounds for information reconciliation and privacy amplification,” in Advances in Cryptology-ASIACRYPT 2005
2005
Earlier work this paper cites.
M. Hayashi, “General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel,” IEEE Transactions on Information Theory
2006
Cited alongside, same era.
Y. Liang and G. Kramer, “Rate regions for relay broadcast channels,” IEEE Transactions on Information Theory
2007
Cited alongside, same era.
C. Dwork, “Differential privacy: A survey of results,” in Theory and Applications of Models of Computation
2008
Cited alongside, same era.
L. Wang, R. Colbeck, and R. Renner, “Simple channel coding bounds,” in Proceedings of 2009 IEEE International Symposium on Information Theory
2009
Cited alongside, same era.
Y. Polyanskiy, H. V. Poor, and S. Verdú, “Channel coding rate in the finite blocklength regime,” IEEE Transactions on Information Theory
2010
Cited alongside, same era.
Y. Polyanskiy and S. Verdú, “Empirical distribution of good channel codes with nonvanishing error probability,” IEEE Transactions on Information Theory
2014
Later among the works it cites.
S. Watanabe and M. Hayashi, “Strong converse and second-order asymptotics of channel resolvability,” in Proceedings of 2014 IEEE International Symposium on Information Theory
2014
Later among the works it cites.
J. Hou and G. Kramer, “Effective secrecy: Reliability, confusion and stealth,” in Proceedings of 2014 IEEE International Symposium on Information Theory
2014
Later among the works it cites.
S. Verdú, “Total variation distance and the distribution of relative information,” in Workshop on Information Theory and Applications
2014
Later among the works it cites.
Y. Polyanskiy private communication
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Y. Polyanskiy and S. Verdú, “Arimoto channel coding converse and Rényi divergence,” in 48th Annual Allerton Conference on Communication, Control, and Computing
2010
Cited alongside, same era.
Y. Polyanskiy, “Channel coding: non-asymptotic fundamental limits,” PhD Thesis, Princeton University
2010
Cited alongside, same era.
Cambridge University Press, 2011
A. El Gamal and Y.-H. Kim, Network Information Theory · 2011
Cited alongside, same era.
Y. Liang, G. Kramer, and H. V. Poor, “On the equivalence of two achievable regions for the broadcast channel,” IEEE Transactions on Information Theory
2011
Cited alongside, same era.
S. Verdú, “Non-asymptotic achievability bounds in multiuser information theory,” in 50th Annual Allerton Conference on Communication, Control, and Computing
2012
Cited alongside, same era.
2012
Cited alongside, same era.
John Wiley & Sons, 2012
T. M. Cover and J. A. Thomas, Elements of Information Theory (Second Edition) · 2012
Cited alongside, same era.
T. V. Erven and P. Harremoës, “Rényi divergence and Kullback-Leibler divergence,” IEEE Transactions on Information Theory
2014
Later among the works it cites.
M. Raginsky and I. Sason, “Concentration of measure inequalities in information theory, communications, and coding,” Foundations and Trends in Communications and Information Theory
2014
Later among the works it cites.
J. Liu, P. Cuff, and S. Verdú, “Key capacity with limited one-way communication for product sources,” in Proceedings of 2014 IEEE International Symposium on Information Theory
2014
Later among the works it cites.
C. H. Bennett, I. Devetak, A. W. Harrow, P. W. Shor, and A. Winter, “The quantum reverse Shannon theorem and resource tradeoffs for simulating quantum channels,” IEEE Transactions on Information Theory
2014
Later among the works it cites.
J. Liu, P. Cuff, and S. Verdú, “One-shot mutual covering lemma and Marton’s inner bound with a common message,” in Proceedings of 2015 IEEE International Symposium on Information Theory
2015
Closest in time.
M. Bloch, “A channel resolvability perspective on stealth communications,” in Proceedings of 2015 IEEE International Symposium on Information Theory
2015
Closest in time.
J. Liu, P. Cuff, and S. Verdú, “Resolvability in E γ E_{\gamma} with applications to lossy compression and wiretap channels,” in Proceedings of 2015 IEEE International Symposium on Information Theory
2015
Closest in time.
J. Liu, J. Jin, and Y. Gu, “Robustness of sparse recovery via f f -minimization: A topological viewpoint,” IEEE Transactions on Information Theory
2015
Closest in time.
S. Verdú, “Non-asymptotic covering lemmas,” in Proc. 2015 IEEE Information Theory Workshop
2015
Closest in time.
M. H. Yassaee, “One-shot achievability via fidelity,” in Proceedings of 2015 IEEE International Symposium on Information Theory
2015
Closest in time.
E. C. Song, P. Cuff, and H. V. Poor, “The likelihood encoder for lossy compression,” IEEE Transactions on Information Theory
2016
Closest in time.
P. Cuff, “Soft covering with high probability,” in Proceedings of 2016 IEEE International Symposium on Information Theory
2016
Closest in time.
Z. Goldfeld, P. Cuff, and H. H. Permuter, “Semantic-security capacity for wiretap channels of type ii,” in Proceedings of 2016 IEEE International Symposium on Information Theory
2016
Closest in time.
M. Tahmasbi and M. R. Bloch, “Second-order asymptotics of covert communications over noisy channels,” in Proceedings of 2016 IEEE International Symposium on Information Theory
2016
Closest in time.
I. Sason and S. Verdú, “ f f -divergence inequalities,” IEEE Transactions on Information Theory
2016
Closest in time.