# An upper bound on moments of sequential decoding effort

@article{Jelinek1969AnUB,
title={An upper bound on moments of sequential decoding effort},
author={Frederick Jelinek},
journal={IEEE Trans. Information Theory},
year={1969},
volume={15},
pages={140-149}
}
In this paper we derive an infinite tree code ensemble upper bound on the \nu th (\nu \leq 1) moments of the computational effort connected with sequential decoding governed by the Fano \footnote[1]{algorithm}. It is shown that the \nu th moment of the effort per decoded branch is hounded by a constant, provided the transmission rate R_{0} satisfies inequality (2), This result, although often conjectured, has previously been shown to hold only for positive integral values of \nu . For a wide… CONTINUE READING

#### Citations

##### Publications citing this paper.
SHOWING 1-10 OF 20 CITATIONS

## Sequential Decoding of Convolutional Codes

VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

## Capacity-Achieving Guessing Random Additive Noise Decoding

Ken R. Duffy, Jiange Li
• IEEE Transactions on Information Theory
• 2019
VIEW 1 EXCERPT
CITES BACKGROUND

## Guessing random additive noise decoding with soft detection symbol reliability information - SGRAND

• 2019 IEEE International Symposium on Information Theory (ISIT)
• 2019
VIEW 1 EXCERPT
CITES BACKGROUND

• ArXiv
• 2018
VIEW 1 EXCERPT
CITES BACKGROUND

VIEW 1 EXCERPT
CITES METHODS

## New arriving process for convolutional codes with adaptive behavior

• International Multi-Conference on Systems, Sygnals & Devices
• 2012
VIEW 1 EXCERPT

## Bounded Fano Decoders over Intermediate Hops Excluding Packet Retransmission

• 2010 24th IEEE International Conference on Advanced Information Networking and Applications
• 2010
VIEW 1 EXCERPT
CITES BACKGROUND

VIEW 1 EXCERPT
CITES BACKGROUND

VIEW 1 EXCERPT
CITES METHODS

## Sequential decoding for lossless streaming source coding with side information

• ArXiv
• 2007
VIEW 1 EXCERPT
CITES BACKGROUND

#### References

##### Publications referenced by this paper.
SHOWING 1-5 OF 5 REFERENCES

## Bounds on the performance of an economical sequential decoder,

F. Jelinek, F. L. Huband
• Hawaii Internat’l Conf. on System Sciences,
• 1968

## Sequential decodingthe computat ion prob1963

J. E. Savage
• Bell Sys . Tech . J . Probabilistic Information Theory
• 1968

## A lower bound to the distribution of computation for sequential decoding

• IEEE Trans. Information Theory
• 1967

R. M. Fano
• 1961

J. J. Bussgang