Construction of partial unit memory encoders for application in capacity-approaching concatenated codes
暂无分享,去创建一个
[1] Bahram Honary,et al. Minimal trellis design for linear codes based on the Shannon product , 1996, IEEE Trans. Inf. Theory.
[2] Gregory S. Lauer. Some optimal partial-unit-memory codes (Corresp.) , 1979, IEEE Trans. Inf. Theory.
[3] Bahram Honary,et al. PUM-Based Turbo Codes , 2002 .
[4] Joachim Hagenauer,et al. Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.
[5] Uwe Dettmar,et al. New optimal partial unit memory codes based on extended BCH codes , 1993 .
[6] A. Glavieux,et al. Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.
[7] John Cocke,et al. Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.
[8] Bahram Honary,et al. Using partial unit memory codes to improve distance properties of woven turbo codes , 2003 .
[9] Rolf Johannesson,et al. Fundamentals of Convolutional Coding , 1999 .
[10] S. A. Shavgulidze,et al. New optimal partial unit memory codes , 1992 .
[11] Bahram Honary,et al. On the use of partial unit memory codes for woven turbo codes with outer and inner warp , 2005 .
[12] K. Abdel-Ghaffar,et al. Some Partial Unit Memory Convolutional Codes , 1991, Proceedings. 1991 IEEE International Symposium on Information Theory.
[13] Jung-Fu Cheng,et al. Unit-memory Hamming turbo codes , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.