Published 2021-04-01
“…We further propose a simple
Huffman code-based construction of a function <i>f</i> that is a viable candidate for the minimization of the least exponential growth rate in the two-stage guessing setup. (2) We characterize the least achievable exponential growth rate of the <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>ρ</mi></semantics></math></inline-formula>-th moment of the total number of guesses required to recover <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msup><mi>X</mi><mi>n</mi></msup></semantics></math></inline-formula> when Stage 1 need not end with a correct guess of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msup><mi>Y</mi><mi>n</mi></msup></semantics></math></inline-formula> and without assumptions on the stationary memoryless sources producing <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msup><mi>X</mi><mi>n</mi></msup></semantics></math></inline-formula> and <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msup><mi>Y</mi><mi>n</mi></msup></semantics></math></inline-formula>.…”
Get full text
Article