Fetching the paper…
Reading the bibliography…
This paper gives upper and lower bounds on the minimum error probability of Bayesian $M$-ary hypothesis testing in terms of the Arimoto-R\'enyi conditional entropy of an arbitrary order $\alpha$.
C. E. Shannon, “A mathematical theory of communication,” Bell System Technical Journal
1948
Earlier work this paper cites.
R. M. Fano, Class Notes for Course 6.574: Transmission of Information
1952
Earlier work this paper cites.
A. Feinstein, “A new basic theorem of information theory,” IEEE Trans. on Information Theory
1954
Earlier work this paper cites.
C. E. Shannon, “Certain results in coding theory for noisy channels,” Information and Control
1957
Earlier work this paper cites.
C. E. Shannon, “Channels with side information at the transmitter,” IBM Journal on Research and Development
1958
Earlier work this paper cites.
A. Rényi, “On measures of entropy and information,” Proceedings of the Fourth Berkeley Symposium on Probability Theory and Mathematical Statistics
1961
Earlier work this paper cites.
L. L. Campbell, “A coding theorem and Rényi’s entropy,” Information and Control
1965
Earlier work this paper cites.
R. G. Gallager, “A simple derivation of the coding theorem and some applications,” IEEE Trans. on Information Theory
1965
Earlier work this paper cites.
L. Baladová, “Minimum of average conditional entropy for given mimimum probability of error,” Kybernetika
1966
Earlier work this paper cites.
J. Chu and J. Chueh, “Inequalities between information measures and error probability,” Journal of the Franklin Institute
1966
Earlier work this paper cites.
T. M. Cover and P. E. Hart, “Nearest neighbor pattern classification,” IEEE Trans. on Information Theory
1967
Earlier work this paper cites.
T. Kailath, “The divergence and Bhattacharyya distance measures in signal selection,” IEEE Trans. on Communication Technology
1967
Earlier work this paper cites.
C. Shannon, R. Gallager and E. Berlekamp, “Lower bounds to error probability for decoding on discrete memoryless channels - Part I,” Information and Control
1967
Earlier work this paper cites.
G. D. Forney, “Exponential error bounds for erasure, list, and decision feedback schemes,” IEEE Trans. Information Theory
1968
Earlier work this paper cites.
R. G. Gallager, Information Theory and Reliable Communication
1968
Earlier work this paper cites.
V. A. Kovalevsky, “The problem of character recognition from the point of view of mathematical statistics,” in Reading Automata and Pattern Recognition
1968
Earlier work this paper cites.
D. Tebbe and S. Dwyer, “Uncertainty and the probability of error,” IEEE Trans. on Information Theory
1968
Earlier work this paper cites.
I. Vajda, “Bounds on the minimal error probability on checking a finite or countable number of hypotheses,” Problems of Information Transmission
1968
Earlier work this paper cites.
R. Sibson, “Information radius,” Probability Theory and Related Fields
1969
Earlier work this paper cites.
M. E. Hellman and J. Raviv, “Probability of error, equivocation, and the Chernoff bound,” IEEE Trans. on Information Theory
1970
Earlier work this paper cites.
S. Arimoto, “Information-theoretical considerations on estimation problems,” Information and Control
1971
Earlier work this paper cites.
G. T. Toussiant, “Comments on the divergence and Bhattacharyya distance measures in signal selection,” IEEE Trans. on Communications
1972
Earlier work this paper cites.
S. Arimoto, “On the converse to the coding theorem for discrete memoryless channels,” IEEE Trans. Information Theory , vol. 19, no. 3, pp. 357–359, May 1973
1973
Earlier work this paper cites.
R. G. Gallager, “The random coding bound is tight for the average code,” IEEE Trans. on Information Theory
1973
Earlier work this paper cites.
P. A. Devijver, “On a new class of bounds on Bayes risk in multihypothesis pattern recognition,” IEEE Trans. on Computers
1974
Earlier work this paper cites.
R. Ahlswede, P. Gács and J. Körner, “Bounds on conditional probabilities with applications in multi-user communication,” Z. Wahrscheinlichkeitstheorie verw. Gebiete
1977
Earlier work this paper cites.
S. Arimoto, “Information measures and capacity of order α \alpha for discrete memoryless channels,” in Topics in Information Theory - 2nd Colloquium
1977
Earlier work this paper cites.
G. T. Toussiant, “A generalization of Shannon’s equivocation and the Fano bound,” IEEE Trans. on Systems, Man and Cybernetics
1977
Earlier work this paper cites.
M. Ben-Bassat and J. Raviv, “Rényi’s entropy and probability of error,” IEEE Trans. on Information Theory
1978
Earlier work this paper cites.
M. Feder and N. Merhav, “Relations between entropy and error probability,” IEEE Trans. on Information Theory
1994
Cited alongside, same era.
T. S. Han and S. Verdú, “Generalizing the Fano inequality,” IEEE Trans. on Information Theory
1994
Cited alongside, same era.
I. Csiszár, “Generalized cutoff rates and Rényi information measures,” IEEE Trans. on Information Theory
1995
Cited alongside, same era.
F. Kanaya and T. S. Han, “The asymptotics of posterior entropy and error probability for Bayesian estimation,” IEEE Trans. on Information Theory , vol. 41, no. 6, pp. 1988–1992, November 1995
1995
Cited alongside, same era.
H. V. Poor and S. Verdú, “A lower bound on the probability of error in multihypothesis testing,” IEEE Trans. on Information Theory
1995
Cited alongside, same era.
I. Sason, “Moderate deviations analysis of binary hypothesis testing,” Proceedings of the 2012 IEEE International Symposium on Information Theory
2012
Later among the works it cites.
S. Berens, Conditional Rényi Entropy
2013
Later among the works it cites.
M. Müller-Lennert, F. Dupuis, O. Szehr, S. Fehr and M. Tomamichel, “On quantum Rényi entropies: a new definition and some properties,” Journal of Mathematical Physics
2013
Later among the works it cites.
C. Bunte and A. Lapidoth, “Encoding tasks and Rényi entropy,” IEEE Trans. on Information Theory
2014
Later among the works it cites.
C. Bunte and A. Lapidoth, “On the listsize capacity with feedback,” IEEE Trans. on Information Theory
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…
E. Arikan, “An inequality on guessing and its application to sequential decoding,” IEEE Trans. on Information Theory
1996
Cited alongside, same era.
C. C. Leang and D. H. Johnson, “On the asymptotics of M M -hypothesis Bayesian detection,” IEEE Trans. on Information Theory
1997
Cited alongside, same era.
D. Erdogmus and J. Principe, “Lower and upper bounds for misclasification probability based on Rényi’s information,” Journal of VLSI Signal Processing
2004
Cited alongside, same era.
L. Birgé, “A new lower bound for multiple hypothesis testing,” IEEE Trans. Information Theory
2005
Cited alongside, same era.
R. Renner, Security of Quantum Key Distribution
2005
Cited alongside, same era.
T. M. Cover and J. A. Thomas, Elements of Information Theory
2006
Cited alongside, same era.
R. M. Roth, Introduction to Coding Theory
2006
Cited alongside, same era.
T. Courtade and S. Verdú, “Cumulant generating function of codeword lengths in optimal lossless compression,” Proceedings of the 2014 IEEE International Symposium on Information Theory
2014
Later among the works it cites.
T. van Erven and P. Harremoës, “Rényi divergence and Kullback-Leibler divergence,” IEEE Trans. on Information Theory
2014
Later among the works it cites.
S. Fehr and S. Berens, “On the conditional Rényi entropy,” IEEE Trans. on Information Theory
2014
Later among the works it cites.
M. Iwamoto and J. Shikata, “Information theoretic security for encryption based on conditional Rényi entropies,” Proceedings of the 7th International Conference on Information Theoretic Security
2014
Later among the works it cites.
N. Merhav, “List decoding – random coding exponents and expurgated exponents,” IEEE Trans. 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,” Second Edition, Foundations and Trends in Communications and Information Theory
2014
Later among the works it cites.
M. Tomamichel, M. Berta and M. Hayashi, “Relating different quantum generalizations of the conditional Rényi entropy,” Journal of Mathematical Physics
2014
Later among the works it cites.
A. M. Wilde, A. Winter, and D. Yang, “Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy,” Communications in Mathematical Physics
2014
Later among the works it cites.
A. Bracher, E. Hof and A. Lapidoth, “Guessing attacks on distributed-storage systems,” Proceedings of the 2015 IEEE International Symposium on Information Theory
2015
Later among the works it cites.
M. Hayashi and M. Tomamichel, “Correlation detection and an operational interpretation of the Rényi mutual information,” Proceedings of the 2015 IEEE International Symposium on Information Theory
2015
Later among the works it cites.
S. W. Ho and S. Verdú, “Convexity/concavity of the Rényi entropy and α \alpha -mutual information,” Proceedings of the 2015 IEEE International Symposium on Information Theory
2015
Later among the works it cites.
S. Prasad, “Bayesian error-based sequences of statistical information bounds,” IEEE Trans. on Information Theory
2015
Later among the works it cites.
S. Verdú, “ α \alpha -mutual information,” Workshop on Information Theory and Applications
2015
Later among the works it cites.
M. Hayashi and V. Y. F. Tan, “Remaining uncertainties and exponents under Rényi information measures,” Proceedings of the 2016 IEEE International Symposium on Information Theory
2016
Later among the works it cites.
A. Lalitha and T. Javidi, “Reliability of sequential hypothesis testing can be achieved by an almost-fixed-length-test,” Proceedings of the 2016 IEEE International Symposium on Information Theory
2016
Later among the works it cites.
A. Lapidoth and C. Pfister, “Two measures of dependence,” Proceedings of the 2016 IEEE International Conference on the Science of Electrical Engineering
2016
Later among the works it cites.
F. Leditzky, M. M. Wilde and N. Datta, “Strong converse theorems using Rényi entropies,” Journal of Mathematical Physics
2016
Later among the works it cites.
Y. Sakai and K. Iwata, “Relations between conditional Shannon entropy and expectation of l α l_{\alpha} -norm,” Proceedings of the 2016 IEEE International Symposium on Information Theory
2016
Later among the works it cites.
I. Sason and S. Verdú, “ f f -divergence inequalities,” IEEE Trans. on Information Theory
2016
Later among the works it cites.
M. Tomamichel and M. Hayashi, “Operational interpretation of Rényi conditional mutual information via composite hypothesis testing against Markov distributions,” Proceedings of the 2016 IEEE International Symposium on Information Theory
2016
Later among the works it cites.
G. Vázquez-Vilar, A. Tauste-Campo, A. Guillén-Fábregas, and A. Martinez, “Bayesian M M -ary hypothesis testing: The meta-converse and Verdú–Han bounds are tight,” IEEE Trans. on Information Theory
2016
Later among the works it cites.
M. Hayashi and V. Y. F. Tan, “Equivocation and exponents under various Rényi information measures,” IEEE Trans. on Information Theory
2017
Closest in time.