A branching process analysis of the average number of computations of the stack algorithm
- 1 May 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 30 (3) , 497-508
- https://doi.org/10.1109/tit.1984.1056921
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A Markov chain analysis of the sequential decoding metric (Corresp.)IEEE Transactions on Information Theory, 1980
- On the distribution of computation for sequential decoding using the stack algorithmIEEE Transactions on Information Theory, 1979
- Generalized stack algorithms for decoding convolutional codesIEEE Transactions on Information Theory, 1975
- Convolutional codes III. Sequential decodingInformation and Control, 1974
- Tree encoding for symmetric sources with a distortion measureIEEE Transactions on Information Theory, 1974
- Certain infinite Markov chains and sequential decodingDiscrete Mathematics, 1972
- On the error probability of sequential decoding on the BSCIEEE Transactions on Information Theory, 1972
- A construction technique for random-error-correcting convolutional codesIEEE Transactions on Information Theory, 1969
- A lower bound to the distribution of computation for sequential decodingIEEE Transactions on Information Theory, 1967
- A heuristic discussion of probabilistic decodingIEEE Transactions on Information Theory, 1963