Renyi's entropy and the probability of error

DOI10.1109/TIT.1978.1055890MaRDI QIDQ4180260zbMATH OpenFDO

Authors Moshe Ben-Bassat, J. Raviv

Publication date 1978

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

Coding TheoremsError ProbabilityRenyi's Entropy

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24)

Cited in

(15)

• Further results on generalized conditional entropies
• A joint Shannon cipher and privacy amplification approach to attaining exponentially decaying information leakage
• On Kirkwood-Dirac quasiprobabilities and unravelings of quantum channel assigned to a tight frame
• On conclusive eavesdropping and measures of mutual information in quantum key distribution
• Lower Bound on the Error Probability for Families with Bounded Likelihood Ratios
• ON SOME INEQUALITIES AND GENERALIZED ENTROPIES: A UNIFIED APPROAC
• Maximal coherence and the resource theory of purity
• Trigonometric entropies, Jensen difference divergence measures, and error bounds
• Limits to extreme event forecasting in chaotic systems
• Some properties of Rényi entropy over countably infinite alphabets
• Individual attacks with generalized discrimination and inadequacy of some information measures
• Rényi and Tsallis formulations of separability conditions in finite dimensions
• Generalized information criteria for Bayes decisions
• Relations between the observational entropy and Rényi information measures
• Tsallis entropy measure of noise-aided information transmission in a binary channel

This page was built for publication: Renyi's entropy and the probability of error

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4180260)