An inequality on guessing and its application to sequential decoding
From MaRDI portal
Publication:4879993
DOI10.1109/18.481781zbMATH Open0845.94020OpenAlexW2165203736MaRDI QIDQ4879993FDOQ4879993
Authors: Erdal Arikan 
Publication date: 2 June 1996
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/25705
Recommendations
Analysis of algorithms and problem complexity (68Q25) Measures of information, entropy (94A17) Convolutional codes (94B10) Decoding (94B35)
Cited In (17)
- Rényi entropies of dynamical systems: a generalization approach
- Large deviations for conditional guesswork
- Some inequalities and their application for estimating the moments of guessing mappings
- Estimation of arithmetic means and their applications in guessing theory
- Cramér-Rao lower bounds arising from generalized Csiszár divergences
- Information Theoretic Security for Encryption Based on Conditional Rényi Entropies
- Some new analytic inequalities and their applications in guessing theory
- A companion of the Grüss inequality and applications.
- Quantum privacy and quantum wiretap channels
- Joint range of Rényi entropies
- Compressibility of random walker trajectories on growing networks
- Moment-entropy inequality for isotropic measures
- On \(q\)-non-extensive statistics with non-Tsallisian entropy
- Renyi entropy estimation revisited
- A family of multipartite entanglement measures
- Uniform continuity bound for sandwiched Rényi conditional entropy
- Optimal guessing under nonextensive framework and associated moment bounds
This page was built for publication: An inequality on guessing and its application to sequential decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4879993)
