New upper bounds for decoding error probability for convolutional codes
From MaRDI portal
Recommendations
- On upper bounds for the decoding error probability of convolutional codes
- New decoding error probability bounds for fixed convolutional codes used in BSC
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Tighter bounds on the error probability of fixed convolutional codes
- scientific article; zbMATH DE number 3959275
Cited in
(22)- On the theory of list decoding of convolutional codes
- New approach to estimation of the decoding error probability
- On upper bounds for the decoding error probability of convolutional codes
- New decoding error probability bounds for fixed convolutional codes used in BSC
- 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
- Upper Bounds on the Number of Errors Corrected by a Convolutional Code
- scientific article; zbMATH DE number 3959275 (Why is no real title available?)
- Bounds on the probability of error for convolutional codes (Corresp.)
- scientific article; zbMATH DE number 3557664 (Why is no real title available?)
- Error exponents for product convolutional codes
- Bounded distance decoding of unit memory codes
- A random coding bound for fixed convolutional codes of rate 1/n
- Improved error exponent for time-invariant and periodically time-variant convolutional codes
- Improving Error Bounds for Multipole-Based Treecodes
- Tighter bounds on the error probability of fixed convolutional codes
- On the probability of error of convolutional codes
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Error probability bounds for systematic convolutional codes
- A stochastic model for burst-correcting convolutional decoders (Corresp.)
- On the converse to the coding theorem for discrete memoryless channels (Corresp.)
This page was built for publication: New upper bounds for decoding error probability for convolutional codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1066865)
