Low rate convolutional and turbo codes based on non-linear cyclic codes
暂无分享,去创建一个
[1] Patrick Robertson,et al. A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain , 1995, Proceedings IEEE International Conference on Communications ICC '95.
[2] Francisco Cercas,et al. TCH: A New Family of Cyclic Codes Length 2/sup m/ , 1993, Proceedings. IEEE International Symposium on Information Theory.
[3] Pål K. Frenger,et al. Code-spread CDMA using maximum free distance low-rate convolutional codes , 1998, IEEE Trans. Commun..
[4] Kari Pehkonen,et al. Performance Evaluation of Superorthogonal Turbo Codes in AWGN and Flat Rayleigh Fading Channels , 1998, IEEE J. Sel. Areas Commun..
[5] A. Viterbi. CDMA: Principles of Spread Spectrum Communication , 1995 .
[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] Branka Vucetic,et al. Spread spectrum CDMA systems for wireless communications , 1997 .
[9] Patrick Robertson,et al. Bandwidth-Efficient Turbo Trellis-Coded Modulation Using Punctured Component Codes , 1998, IEEE J. Sel. Areas Commun..
[10] Andrew J. Viterbi,et al. Very Low Rate Convolutional Codes for Maximum Theoretical Performance of Spread-Spectrum Multiple-Access Channels , 1990, IEEE J. Sel. Areas Commun..