Pipeline Decoding of Woven Convolutional Codes
暂无分享,去创建一个
[1] Kjell Jørgen Hole. New short constraint length rate (n-1)/n punctured convolutional codes for soft-decision Viterbi decoding , 1988, IEEE Trans. Inf. Theory.
[2] Dariush Divsalar,et al. Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding , 1997, IEEE Trans. Inf. Theory.
[3] Rolf Johannesson,et al. A linear algebra approach to minimal convolutional encoders , 1993, IEEE Trans. Inf. Theory.
[4] Rolf Johannesson,et al. A first encounter with binary woven convolutional codes , 1997 .
[5] Joachim Hagenauer,et al. Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.
[6] Yasuo Hirata,et al. High-Rate Punctured Convolutional Codes for Soft Decision Viterbi Decoding , 1984, IEEE Trans. Commun..
[7] John Cocke,et al. Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.
[8] Rolf Johannesson,et al. On the error exponent for woven convolutional codes with outer warp , 1999, IEEE Trans. Inf. Theory.
[9] Rolf Johannesson,et al. Active Distances for Convolutional Codes , 1999, IEEE Trans. Inf. Theory.
[10] Stefan Höst,et al. On Woven Convolutional Codes , 1999 .
[11] Rolf Johannesson,et al. On the error exponent for woven convolutional codes with inner warp , 2001, IEEE Trans. Inf. Theory.
[12] Rolf Johannesson,et al. Fundamentals of Convolutional Coding , 1999 .
[13] Martin Bossert,et al. Channel Coding for Telecommunications , 1999 .