Error probability for repeat request systems with convolutional codes

DOI10.1109/18.259656MaRDI QIDQ4307385zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

decoding algorithmconvolutional codingerror probability exponentmodified Viterbi algorithmasymptotic error probability boundrepeat request systems

Mathematics Subject Classification ID

Convolutional codes (94B10) Decoding (94B35) Error probability in coding theory (94B70)

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

Cited in

(5)

• Viterbi algorithm for decoding of convolutional codes in a system with decision feedback
• Error Probabilities for Spread-Spectrum Packet Radio with Convolutional Codes and Viterbi Decoding
• A coded ARQ scheme with the generalized Viterbi algorithm
• On the Probability of Error Using a Repeat-Request Strategy on the Additive White Gaussian Noise Channel
• A repeat request strategy based on sliding window decoding of unit-memory convolutional codes

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)