论文信息 - On the distribution of the number of computations in any finite number of subtrees for the stack algorithm

On the distribution of the number of computations in any finite number of subtrees for the stack algorithm

Multitype branching processes have been employed to determine the stack algorithm computational distribution for one subtree. These results are extended here to the distribution of the number of computations in any finite number of subtrees. Starting from the computational distribution for K-1 subsequent subtrees, a recurrent equation for the distribution for K subsequent subtrees is determined.

Rolf Johannesson | Kamil Sh. Zigangirov

[1] Frederick Jelinek,et al. An upper bound on moments of sequential decoding effort , 1969, IEEE Trans. Inf. Theory.

[2] Rolf Johannesson,et al. Further results on binary convolutional codes with an optimum distance profile (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[3] James L. Massey,et al. Certain infinite Markov chains and sequential decoding , 1972, Discret. Math..

[4] Rolf Johannesson. On the distribution of computation for sequential decoding using the stack algorithm , 1979, IEEE Trans. Inf. Theory.

[5] Elwyn R. Berlekamp,et al. A lower bound to the distribution of computation for sequential decoding , 1967, IEEE Trans. Inf. Theory.

[6] John E. Savage. The distribution of the sequential decoding computation time , 1966, IEEE Trans. Inf. Theory.