Upper bounds on sequential decoding performance parameters

DOI10.1109/TIT.1974.1055197MaRDI QIDQ4081134zbMATH OpenFDO

Authors Frederick Jelinek

Publication date 1974

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

Full work available at URL https://doi.org/10.1109/TIT.1974.1055197

Mathematics Subject Classification ID

Convolutional codes (94B10) Decoding (94B35)

Recommendations

• Minimum distance estimates of the performance of sequential decoders
• An upper bound on the cutoff rate of sequential decoding
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• scientific article; zbMATH DE number 4035733
• New upper bounds on error exponents

Cited in

(4)

• Bounds on a Probability for the Heavy Tailed Distribution and the Probability of Deficient Decoding in Sequential Decoding
• An upper bound on the cutoff rate of sequential decoding
• An upper bound on the distribution of computation of a sequential decoder for multiple-access channels
• Recoding-derived bounds for input encoding

This page was built for publication: Upper bounds on sequential decoding performance parameters

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