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

DOI10.1109/TIT.1985.1057001MaRDI QIDQ3347779zbMATH OpenFDO

Authors Kamil S. 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)

Recommendations

• A branching process analysis of the average number of computations of the stack algorithm
• Coding multitype forests: application to the law of the total population of branching forests
• An upper bound on the distribution of computation of a sequential decoder for multiple-access channels
• scientific article; zbMATH DE number 1246231
• scientific article; zbMATH DE number 1156488

Cited in

(3)

• On the stack-size of general tries
• Coding multitype forests: application to the law of the total population of branching forests
• A branching process analysis of the average number of computations of the stack algorithm

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.)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3347779)