An upper bound on the distribution of computation of a sequential decoder for multiple-access channels

DOI10.1109/18.485712MaRDI QIDQ4885671zbMATH OpenOpenAlexFDO

Authors V. B. Balakirskij

Publication date 25 February 1997

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

Full work available at URL https://semanticscholar.org/paper/8efd1b3bcfea76bf428cc574f2024acb5875653f

zbMATH Keywords

Pareto distributiontree codesdecoding metricsequential decodingmultiple-access channels

Mathematics Subject Classification ID

Communication theory (94A05) Decoding (94B35)

Recommendations

• Sequential decoding algorithm in a multiple-access channel
• A branching process analysis of the average number of computations of the stack algorithm
• Sequential decoding for multiple access channels
• Upper bounds on sequential decoding performance parameters
• scientific article; zbMATH DE number 4035733

Cited in

(5)

• Sequential decoding for multiple access channels
• On the distribution of the number of computations in any finite number of subtrees for the stack algorithm (Corresp.)
• A branching process analysis of the average number of computations of the stack algorithm
• Sequential decoding algorithm in a multiple-access channel
• Bounds on a Probability for the Heavy Tailed Distribution and the Probability of Deficient Decoding in Sequential Decoding

This page was built for publication: An upper bound on the distribution of computation of a sequential decoder for multiple-access channels

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