Iterative Network and Channel Decoding on a Tanner Graph
暂无分享,去创建一个
[1] Matthew C. Valenti,et al. Distributed turbo coded diversity for relay channel , 2003 .
[2] T Michael,et al. Joint Source-Channel Decoding on Factor Trees: A Scalable Solution for Large-Scale Sensor Networks , 2004 .
[3] Tracey Ho,et al. Linear Network Codes: A Unified Framework for Source, Channel, and Network Coding , 2003, Advances in Network Information Theory.
[4] R. Koetter,et al. The benefits of coding over routing in a randomized setting , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..
[5] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.
[6] Gregory W. Wornell,et al. Cooperative diversity in wireless networks: Efficient protocols and outage behavior , 2004, IEEE Transactions on Information Theory.
[7] Rüdiger L. Urbanke,et al. Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.
[8] Christina Fragouli,et al. Processing along the way: forwarding vs. coding , 2004 .
[9] Radford M. Neal,et al. Near Shannon limit performance of low density parity check codes , 1996 .
[10] A.J. van Wijngaarden,et al. On the white Gaussian multiple-access relay channel , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).
[11] Raymond W. Yeung,et al. A First Course in Information Theory , 2002 .
[12] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[13] Rudolf Ahlswede,et al. Network information flow , 2000, IEEE Trans. Inf. Theory.