An inequality on guessing and its application to sequential decoding
From MaRDI portal
Publication:4879993
DOI10.1109/18.481781zbMath0845.94020OpenAlexW2165203736MaRDI QIDQ4879993
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
Analysis of algorithms and problem complexity (68Q25) Measures of information, entropy (94A17) Decoding (94B35) Convolutional codes (94B10)
Related Items (17)
Uniform continuity bound for sandwiched Rényi conditional entropy ⋮ On \(q\)-non-extensive statistics with non-Tsallisian entropy ⋮ Unnamed Item ⋮ Moment-entropy inequality for isotropic measures ⋮ Information Theoretic Security for Encryption Based on Conditional Rényi Entropies ⋮ A family of multipartite entanglement measures ⋮ Optimal guessing under nonextensive framework and associated moment bounds ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Compressibility of random walker trajectories on growing networks ⋮ Cramér-Rao lower bounds arising from generalized Csiszár divergences ⋮ A companion of the Grüss inequality and applications. ⋮ Some inequalities and their application for estimating the moments of guessing mappings ⋮ Some new analytic inequalities and their applications in guessing theory ⋮ Large deviations for conditional guesswork ⋮ Quantum privacy and quantum wiretap channels ⋮ Estimation of arithmetic means and their applications in guessing theory
This page was built for publication: An inequality on guessing and its application to sequential decoding
