New Constructions of Low-Complexity Convolutional Codes
暂无分享,去创建一个
[1] R. McEliece,et al. The trellis complexity of convolutional codes , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.
[2] Irina E. Bocharova,et al. Rational rate punctured convolutional codes for soft-decision Viterbi decoding , 1997, IEEE Trans. Inf. Theory.
[3] D. Graupe,et al. Punctured Convolutional Codes of Rate (n - 1)/n and Simplified Maximum Likelihood Decoding , 1979 .
[4] Pil Joong Lee. Constructions of rate (n-1)/n punctured convolutional codes with minimum required SNR criterion , 1988, IEEE Trans. Commun..
[5] M. Mooser. Some periodic convolutional codes better than any fixed code , 1983, IEEE Trans. Inf. Theory.
[6] Robert J. McEliece,et al. On the BCJR trellis for linear block codes , 1996, IEEE Trans. Inf. Theory.
[7] J. Bibb Cain,et al. Punctured convolutional codes of rate (n-1)/n and simplified maximum likelihood decoding (Corresp.) , 1979, IEEE Trans. Inf. Theory.
[8] Øyvind Ytrehus,et al. On maximum length convolutional codes under a trellis complexity constraint , 2004, J. Complex..
[9] David G. Daut,et al. New short constraint length convolutional code constructions for selected rational rates , 1982, IEEE Trans. Inf. Theory.
[10] David Haccoun,et al. High-rate punctured convolutional codes for Viterbi and sequential decoding , 1989, IEEE Trans. Commun..
[11] Richard Demo Souza,et al. Generalized punctured convolutional codes , 2005, IEEE Communications Letters.
[12] Hideki Imai,et al. On classes of rate k/(k+1) convolutional codes and their decoding techniques , 1996, IEEE Trans. Inf. Theory.
[13] Jinn-Ja Chang,et al. Some extended results on the search for good convolutional codes , 1997, IEEE Trans. Inf. Theory.