Theoretical and experimental upper and lower bounds on the efficiency of convolutional codes in a binary symmetric channel

DOI10.1134/s003294602202003xzbMath1530.94064MaRDI QIDQ6173453

Fedor Illarionovich Ivanov, Victor Zyablov, A. A. Kurmukova

Publication date: 21 July 2023

Published in: Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

convolutional codesbit error rateactive distancecode trellis

Mathematics Subject Classification ID

Convolutional codes (94B10)

Cites Work

• Unnamed Item
• A Tightened Upper Bound on the Error Probability of Binary Convolutional Codes with Viterbi Decoding
• Design of parallel concatenated convolutional codes
• Woven convolutional codes .I. Encoder properties
• Critical lengths of error events in convolutional codes
• Active distances for convolutional codes
• A Closed-Form Expression for the Exact Bit Error Probability for Viterbi Decoding of Convolutional Codes

This page was built for publication: Theoretical and experimental upper and lower bounds on the efficiency of convolutional codes in a binary symmetric channel