Joint channel-network coding strategies for networks with low-complexity relays

European Transactions on Telecommunications

Volumn 22, Issue 7, 2011, Pages 396-406

  Johnson, Sarah J ^a   Ong, Lawrence ^a   Kellett, Christopher M ^a  

^a UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ACHIEVABLE RATE REGION; CHANNEL CODING SCHEMES; CHANNEL DECODING; CHANNEL ENCODING; CODING OPERATION; CODING STRATEGY; DECODING STRATEGY; DESTINATION NODES; ERROR CORRECTION CODES; JOINT NETWORK; LOW-COMPLEXITY; RELAY NODE; SIMPLE NETWORKS; SOURCE NODES;

CHANNEL CODING; CODES (SYMBOLS); COMPUTER SIMULATION; ITERATIVE DECODING;

NETWORK CODING;

EID: 81955168025     PISSN: 1124318X     EISSN: 15418251     Source Type: Journal    
DOI: 10.1002/ett.1492     Document Type: Article

References (27)

1. Ahlswede R, Cai N, Li SY, Yeung RW,. Network information flow. IEEE Transactions on Information Theory 2000; 46 (4): 1204-1216.
2. Song L, Yeung RW, Cai N,. A separation theorem for single-source network coding. IEEE Transactions on Information Theory 2006; 52 (5): 1861-1871.
3. Borade S,. Network information flow: limits and achievability. In Proceedings of IEEE International Symposium on Information Theory, Lausanne, Switzerland, 2002; 661-666.
4. Effros M, Medard M, Ho T, Ray S, Karger D, Koetter R, Hassibi B,. Linear network codes: a unified framework for source, channel, and network coding. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Rutgers University, Piscataway, NJ, USA 2003; 66: 197-216.
5. Hausl C,. Joint network-channel coding for the multiple-access relay channel based on turbo codes. European Transactions on Telecommunications 2009; 20: 175-181.
6. Hausl C, Hagenauer J,. Iterative network and channel decoding for the two-way relay channel. Proceedings of the 2006 IEEE International Conference on Communications 2006; 4: 1568-1573. (Pubitemid 351575215)
7. Hausl C, Schreckenbach F, Oikonomidis I, Bauch G,. Iterative network and channel decoding on a Tanner graph. In Proceedings of the 43rd Annual Allertion Conference on Communication, Control, and Computing, Monticello, Illinois, USA, 2005.
8. Chakrabarti A, de Baynast A, Sabharwal A, Aazhang B,. Low density parity check codes for the relay channel. IEEE Journal on Selected Areas in Communications February 2007; 25 (2): 280-291.
9. Hu J, Duman TM,. Low density parity check codes over wireless relay channels. IEEE Transactions on Wireless Communications 2007; 6 (9): 3384-3394. (Pubitemid 47625217)
10. Razaghi P, Yu W,. Bilayer low-density parity-check codes for decode-and-forward in relay channels. IEEE Transactions on Information Theory 2007; 53 (10): 3723-3739. (Pubitemid 47534523)
11. Bao X, Li J,. A unified channel-network coding treatment for user cooperation in wireless ad-hoc networks. In Proceedings of the IEEE International Symposium on Information Theory, Seattle, Washington, USA, 2006; 202-206. (Pubitemid 351244081)
12. Tran T, Nguyen T, Bose B,. A joint network-channel coding technique for single-hop wireless networks. In Proceedings of the Fourth Workshop on Network Coding, Theory and Applications (NETCOD), 2008; 1-6.
13. Langberg M, Sprintson A, Bruck J,. Network coding: a computational perspective. IEEE Transactions on Information Theory 2009; 55 (1): 147-157.
14. Sankaranarayanan L, Kramer G, Mandayam NB,. Hierarchical sensor networks: capacity bounds and cooperative strategies using the multiple-access relay channel model. In Proceedings of the First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (IEEE SECON), 2004; 191-199. (Pubitemid 40789279)
15. Yang S, Koetter R,. Network coding over a noisy relay: a belief propogation approach. In Proceedings of the IEEE International Symposium on Information Theory, Nice, France, 2007; 801-804.
16. Yang Z, Tong L,. On the error exponent and the use of LDPC codes for cooperative sensor networks with misinformed nodes. IEEE Transactions on Information Theory Sept 2007; 53 (9): 3265-3274.
17. Elias P,. Coding for noisy channels. IRE Convention Record 1955; 4: 37-46.
18. Liao H,. Multiple access channel, PhD Thesis, University of Hawaii, Honolulu, HI, 1972.
19. Ahlswede R,. The capacity of a channel with two senders and two receivers. Annals Probability 1974; 2: 805-814.
20. Ong L, Johnson SJ, Kellett CM,. Achievable rate regions of the butterfly network with noisy links and end-to-end error correction. In Proceedings of IEEE Information Theory Workshop (ITW), Taormina, Italy, 2009; 554-558.
21. Gallager RG,. Low-Density Parity-Check Codes. MIT Press: Cambridge: MA, 1963.
22. MacKay DJC,. Good error-correcting codes based on very sparse matrices. IEEE Transactions Information Theory 1999; 45 (2): 399-431.
23. Chung SY, Forney Jr GD, Richardson TJ, Urbanke RL,. On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit. IEEE Communications Letters 2001; 5 (2): 58-60. (Pubitemid 32286625)
24. MacKay DJC, Neal RM,. Near Shannon limit performance of low density parity check codes. Electronics Letters March 1996; 32 (18): 1645-1646. ReprintedElectronics Letters, March 1997; 33 (6):457-458. (Pubitemid 126546283)
25. Tanner RM,. A recursive approach to low complexity codes. IEEE Transactions Information Theory 1981; IT-27 (5): 533-547. (Pubitemid 12446960)
26. Johnson SJ, Kellett CM,. Joint network and channel coding for cooperative networks. In Proceedings of the Australasian Telecommunication Networks and Applications Conference, Christchurch, New Zealand, 2007.
27. Kang J, Zhou B, Ding Z, Lin S,. LDPC coding schemes for error control in a multicast network. In Proceedings of the IEEE International Symposium on Information Theory, Toronto, Canada, 2008; 822-826.