2000 character limit reached
Smooth Rényi Entropy of Ergodic Quantum Information Sources
Published 26 Apr 2007 in quant-ph, cs.IT, and math.IT | (0704.3504v1)
Abstract: We prove that the average smooth Renyi entropy rate will approach the entropy rate of a stationary, ergodic information source, which is equal to the Shannon entropy rate for a classical information source and the von Neumann entropy rate for a quantum information source.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
