On upper bounds for the decoding error probability of convolutional codes
From MaRDI portal
Recommendations
- New upper bounds for decoding error probability for convolutional codes
- On the probability of error of convolutional codes
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- New decoding error probability bounds for fixed convolutional codes used in BSC
- Tighter bounds on the error probability of fixed convolutional codes
Cited in
(11)- New upper bounds for decoding error probability for convolutional codes
- Further Exploration of Convolutional Encoders for Unequal Error Protection and New UEP Convolutional Codes
- A new upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes (Corresp.)
- Limiting error propagation in Viterbi decoding of convolutional codes
- scientific article; zbMATH DE number 3959275 (Why is no real title available?)
- scientific article; zbMATH DE number 1188998 (Why is no real title available?)
- On the error exponent of convolutionally coded ARQ
- Tighter bounds on the error probability of fixed convolutional codes
- DC-free error-correcting codes based on convolutional codes
- On Convexity of Error Rates in Digital Communications
- Theoretical and experimental upper and lower bounds on the efficiency of convolutional codes in a binary symmetric channel
This page was built for publication: On upper bounds for the decoding error probability of convolutional codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1812389)
