Error Probability for Repeat Request Systems with Convolutional Codes

IEEE Transactions on Information Theory

Volumn 39, Issue 5, 1993, Pages 1680-1684

  Kudryashov, Boris D ^a  

^a SAINT PETERSBURG STATE UNIVERSITY OF AEROSPACE INSTRUMENTATION   (Russian Federation)

Author keywords

convolutional coding; error probability exponent; Repeat request system; Viterbi algorithm

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); ERROR ANALYSIS; PROBABILITY;

CONVOLUTIONAL CODES; REPEAT REQUEST SYSTEMS; VITERBI ALGORITHM;

INFORMATION THEORY;

EID: 0027663483     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.259656     Document Type: Article

References (5)

1. G. D. Forney, “Exponential error bounds for erasure, list and decision feedback schemes,” IEEE Trans. Inform. Theory, vol. IT-14, pp. 208–220, Mar. 1968.
2. H. Yamomoto and K. Itoh, “Viterby decoding algorithm for convolution codes for repeat request,” IEEE Trans. Inform. Theory, vol. IT-26, pp. 540–548, Sept. 1980.
3. B. D. Kudryashov, “Viterbi algorithm for convolutional code decoding in a system with decision feedback, Probl. Peredach. Inform., vol. 20, no. 2, pp. 18–26, 1984.
4. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
5. G. D. Forney, “Convolutional codes, II: Maximum likelihood decoding,” Inform. Contr., vol. 25, no. 3, pp. 222–266, 1974.