Asymptotic bit error probability for convolutional codes
From MaRDI portal
This note presents a generalization of \textit{M. V. Burnashev's} and \textit{D. L. Kohn's} [Probl. Peredachi Inf. 26, No. 4, 3-15 (1990; Zbl 0719.94018)] result for rate \((2,1)\)-convolutional encoders to arbitrary \((n,k)\)-convolutional encoders. An exact formula for the symbol error probability is derived, and a table of codes with good asymptotic behaviour is given.
Recommendations
- Symbol error probability for convolutional codes
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- On the probability of error of convolutional codes
- Bounds on the probability of error for convolutional codes (Corresp.)
- Error probability bounds for systematic convolutional codes
Cited in
(9)- Symbol error probability for convolutional codes
- Limiting error propagation in Viterbi decoding of convolutional codes
- Analytic Expressions for the Bit Error Probabilities of Rate-<tex>$1/2$</tex>Memory<tex>$2$</tex>Convolutional Encoders
- Error Probabilities for Spread-Spectrum Packet Radio with Convolutional Codes and Viterbi Decoding
- On the error exponent of convolutionally coded ARQ
- Tighter bounds on the error probability of fixed convolutional codes
- On a technique to calculate the exact performance of a convolutional code
- On Exact Asymptotics of the Error Probability in Channel Coding: Symmetric Channels
- On Convexity of Error Rates in Digital Communications
This page was built for publication: Asymptotic bit error probability for convolutional codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179615)
