Error probability for repeat request systems with convolutional codes
From MaRDI portal
Publication:4307385
DOI10.1109/18.259656zbMATH Open0802.94028OpenAlexW2124315884MaRDI QIDQ4307385FDOQ4307385
Authors: Boris D. Kudryashov
Publication date: 3 October 1994
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.259656
Recommendations
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Symbol error probability for convolutional codes
- On the probability of error of convolutional codes
- On the error exponent of convolutionally coded ARQ
- Error Probabilities for Spread-Spectrum Packet Radio with Convolutional Codes and Viterbi Decoding
decoding algorithmconvolutional codingerror probability exponentmodified Viterbi algorithmasymptotic error probability boundrepeat request systems
Cited In (5)
- Error Probabilities for Spread-Spectrum Packet Radio with Convolutional Codes and Viterbi Decoding
- Viterbi algorithm for decoding of convolutional codes in a system with decision feedback
- A repeat request strategy based on sliding window decoding of unit-memory convolutional codes
- On the Probability of Error Using a Repeat-Request Strategy on the Additive White Gaussian Noise Channel
- A coded ARQ scheme with the generalized Viterbi algorithm
This page was built for publication: Error probability for repeat request systems with convolutional codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4307385)