On the distribution of the number of computations in any finite number of subtrees for the stack algorithm (Corresp.)

DOI10.1109/TIT.1985.1057001zbMATH Open0558.94010MaRDI QIDQ3347779

Kamil Sh. Zigangirov, Rolf Johannesson

Publication date: 1985

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

stack algorithmsequential decodingrandom code tree

Mathematics Subject Classification ID

Communication, information (94A99) Decoding (94B35)

Related Items (1)

On the Stack-Size of General Tries

This page was built for publication: On the distribution of the number of computations in any finite number of subtrees for the stack algorithm (Corresp.)