This is the authors' abstract. We don't add key points for this paper.
In this paper we derive an infinite tree code ensemble upper bound on the <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ν</tex> th <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(ν ≤ 1)</tex> moments of the computational effort connected with sequential decoding governed by the Fano [1]{algorithm}. It is shown that the <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ν</tex> th moment of the effort per decoded branch is hounded by a constant, provided the transmission rate <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R₀</tex> satisfies inequality (2), This result, although often conjectured, has previously been shown to hold only for positive integral values of <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ν</tex> . For a wide class of discrete memoryless channels (that includes all symmetric channels), our bounds agree qualitatively with the lower bounds of Jacobs and Berlekamp [8].
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
F. Jelinek (1969) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: