Optimal rate-compatible punctured concatenated zigzag codes
暂无分享,去创建一个
[1] Daniel J. Costello,et al. A distance spectrum interpretation of turbo codes , 1996, IEEE Trans. Inf. Theory.
[2] S. S. Pietrobon,et al. Rate compatible turbo codes , 1995 .
[3] Joachim Hagenauer,et al. Rate-compatible punctured convolutional codes (RCPC codes) and their applications , 1988, IEEE Trans. Commun..
[4] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.
[5] N. Phamdo,et al. Zigzag codes and concatenated zigzag codes , 1999, 1999 Information Theory and Networking Workshop (Cat. No.99EX371).
[6] H. Jin,et al. Irregular repeat accumulate codes , 2000 .
[7] Sae-Young Chung,et al. Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation , 2001, IEEE Trans. Inf. Theory.
[8] Li Ping,et al. Concatenated tree codes: A low-complexity, high-performance approach , 2001, IEEE Trans. Inf. Theory.
[9] Hui Jin,et al. Irregular Repeat – Accumulate Codes 1 , 2000 .
[10] Matthew C. Valenti,et al. Hybrid ARQ using serial concatenated convolutional codes over fading channels , 2001, IEEE VTS 53rd Vehicular Technology Conference, Spring 2001. Proceedings (Cat. No.01CH37202).
[11] Rüdiger L. Urbanke,et al. Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.
[12] Li Ping,et al. Adaptive type II hybrid ARQ scheme using zigzag code , 1999 .