A new upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes (Corresp.)

DOI10.1109/TIT.1984.1056961MaRDI QIDQ3218063zbMATH OpenFDO

Authors Mats Cedervall, Kamil S. Zigangirov, Rolf Johannesson

Publication date 1984

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

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

zbMATH Keywords

binary convolutional codesbinary symmetric channelfirst-event error probabilitymaximum-likelihood decoding

Mathematics Subject Classification ID

Convolutional codes (94B10) Decoding (94B35) Error probability in coding theory (94B70)

Recommendations

• New decoding error probability bounds for fixed convolutional codes used in BSC
• Tighter bounds on the error probability of fixed convolutional codes
• On the probability of error of convolutional codes
• New upper bounds for decoding error probability for convolutional codes
• On upper bounds for the decoding error probability of convolutional codes

Cited in

(4)

• New decoding error probability bounds for fixed convolutional codes used in BSC
• Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes
• A random coding bound for fixed convolutional codes of rate 1/n
• Error-resilient first-order multiplexed source codes: performance bounds, design and decoding algorithms

This page was built for publication: A new upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes (Corresp.)

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