New criteria for determining improved perforation patterns for variable-rate convolutional codes
暂无分享,去创建一个
[1] Yasuo Hirata,et al. High-Rate Punctured Convolutional Codes for Soft Decision Viterbi Decoding , 1984, IEEE Trans. Commun..
[2] Rolf Johannesson,et al. A fast algorithm for computing distance spectrum of convolutional codes , 1989, IEEE Trans. Inf. Theory.
[3] K. X. M. Tzeng,et al. Convolutional Codes and 'Their Performance in Communication Systems , 1971 .
[4] David Haccoun,et al. High-rate punctured convolutional codes for Viterbi and sequential decoding , 1989, IEEE Trans. Commun..
[5] Daniel J. Costello,et al. An algorithm for computing the distance spectrum of trellis codes , 1989, IEEE Journal on Selected Areas in Communications.
[6] J. Bibb Cain,et al. Punctured convolutional codes of rate (n-1)/n and simplified maximum likelihood decoding (Corresp.) , 1979, IEEE Trans. Inf. Theory.
[7] Joachim Hagenauer,et al. Rate-compatible punctured convolutional codes (RCPC codes) and their applications , 1988, IEEE Trans. Commun..
[8] David Haccoun,et al. Further results on high-rate punctured convolutional codes for Viterbi and sequential decoding , 1990, IEEE Trans. Commun..
[9] D. Graupe,et al. Punctured Convolutional Codes of Rate (n - 1)/n and Simplified Maximum Likelihood Decoding , 1979 .