The case for structured random codes in network capacity theorems

European Transactions on Telecommunications

Volumn 19, Issue 4, 2008, Pages 455-474

  Nazer, Bobak ^a   Gastpar, Michael ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CAPACITY; CODES (STANDARDS); COMMUNICATION CHANNELS (INFORMATION THEORY); PROGRAMMING THEORY; RANDOM PROCESSES; STANDARDS;

ACHIEVABILITY; CAPACITY THEOREMS; DISTRIBUTED COMPUTATIONS; FINITE FIELDS; GAUSSIAN; LATTICE CODING; MULTIPLE ACCESS (MAC); NETWORK CAPACITIES; NETWORK CODING; NOISY CHANNELS; RANDOM CODING; SOURCE CODING; STANDARD FORM; STEPPING STONES; STRUCTURED CODING;

CODES (SYMBOLS);

EID: 46749106780     PISSN: 1124318X     EISSN: None     Source Type: Journal    
DOI: 10.1002/ett.1284     Document Type: Article

References (50)

1. Ahlswede R. Multi-way communication channels. In Proceedings of the 2nd International Symposium on Information Theory, Prague, Publishing House of the Hungarian Academy of Sciences, 1971; 23-52.
2. Liao H. Multiple access channels. PhD Thesis, University of Hawaii, Honolulu, 1972.
3. Cover TM. Comments on broadcast channels. IEEE Transactions on Information Theory 1998; 44(6):2524-2530.
4. Cover TM, El Gamal A. Capacity theorems for the relay channel. IEEE Transactions on Information Theory 1979; 25(5):572-584.
5. Körner J, Marton K. How to encode the modulo-two sum of binary sources. IEEE Transactions on Information Theory 1979; 25(2):219-221.
6. Dobrushin RL. Asymptotic optimality of group and systematic codes for some channels. Theory of Probability and its Applications 1963; 8(1)47-59.
7. Ahlswede R. Group codes do not achieve Shannon's channel capacity for general discrete channels. The Annals of Mathematical Statistics 1971; 42(1):224-240.
8. Nazer B, Gastpar M. Computation over multiple-access channels. IEEE Transactions on Information Theory 2007; 53(10):3498-3516.
9. Sarwate AD, Nazer B, Gastpar M. Spatial filtering in sensor networks with computation codes. In Proceedings of the IEEE Statistical Signal Processing Workshop (SSP 2007), Madison, WI, 2007.
10. Nazer B, Gastpar M. Structured random codes and sensor network coding theorems. International Zurich Seminar on Communications (IZS 2008), Zurich, Switzerland, 2008.
11. Krithivasan D, Pradhan S. Lattices for distributed source coding: jointly Gaussian sources and reconstruction of a linear function. IEEE Transactions on Information Theory 2007, Submitted for publication; See http://arxiv.org/abs/0707.3461.
12. Philosof T, Khisti A, Erez U, Zamir R. Lattice strategies for the dirty multiple access channel. In Proceedings of the IEEE International Symposium on Information Theory (ISIT 2007), Nice, France, 2007.
13. Cadambe VR, Jafar SA. Interference alignment and the degrees of freedom for the K user interference channel. IEEE Transactions on Information Theory 2007, Submitted for publication; See http://arxiv.org/abs/0707.0323.
14. Bresler G, Parekh A, Tse D. The approximate capacity of a one-sided interference channel. 45th Annual Allerton Conference, Monticello, IL, 2007.
15. Andrews J, Jindal N, Haenggi M, et al. Rethinking information theory for mobile ad hoc networks. IEEE Communications Magazine 2007, Submitted for publication; See http://arxiv.org/abs/0712.2467.
16. Sanderovich A, Peleg M, Shamai S. Scaling laws in decentralized processing of interfered Gaussian channels. International Zurich Seminar on Communications (IZS 2008), Zurich, Switzerland, 2008.
17. Nazer B, Gastpar M. Computing over multiple-access channels with connections to wireless network coding. In Proceedings of the IEEE International Symposium on Information Theory (ISIT2006), Seattle, WA, 2006.
18. Nazer B, Gastpar M. Lattice coding increases multicast rates for Gaussian multiple-access networks. 45th Annual Allerton Conference, Monticello, IL, 2007.
19. Narayanan K, Wilson MP, Sprintson A. Joint physical layer coding and network coding for bi-directional relaying. 45th Annual Allerton Conference, Monticello, IL, 2007.
20. Nam W, Chung SY, Lee YH. Capacity bounds for two-way relay channels. International Zurich Seminar on Communications (IZS 2008), Zurich, Switzerland, 2008.
21. Gastpar M, Vetterli M. On the capacity of large Gaussian relay networks. IEEE Transactions on Information Theory 2005; 51(3):765-779.
22. Kochman Y, Khina A, Erez U, Zamir R. Rematch and forward for parallel relay networks. Submitted to IEEE International Symposium on Information Theory, 2008.
23. Nazer B, Gastpar M. The case for structured random codes in network communication theorems. In Proceedings of the IEEE Information Theory Workshop (ITW 2007), Lake Tahoe, CA, 2007.
24. Cover TM. A proof of the data compression theorem of Slepian and Wolf for ergodic sources. IEEE Transactions on Information Theory 1975; 21(3):226-228.
25. Cover TM, Leung CSK. An achievable rate region for the multiple-access channel with feedback. IEEE Transactions on Information Theory 1981; 27(3):292-298.
26. Cover TM. Broadcast channels. IEEE Transactions on Information Theory 1972; 18(1):2-14.
27. Slepian D, Wolf J. Noiseless coding of correlated information sources. IEEE Transactions on Information Theory 1973; 19(4)471-480.
28. Zamir R, Shamai S, Erez U. Nested linear/lattice codes for structured multiterminal binning. IEEE Transactions on Information Theory 2002; 48(6):1250-1276.
29. Li SYR, Yeung RW, Cai N. Linear network coding. IEEE Transactions on Information Theory 2003; 49(2):371-381.
30. Koetter R, Medard M. An algebraic approach to network coding. IEEE/ACM Transactions on Networking 2003; 11:782-795.
31. Dougherty R, Freiling C, Zeger K. Insufficiency of linear coding in network information flow. IEEE Transactions on Information Theory 2005; 51(8):2745-2759.
32. Elias P. Coding for noisy channels. IRE Convention Record 1955; 4:37-46.
33. Gallager R. Information Theory and Reliable Communication. John Wiley and Sons, Inc.: New York, 1968.
34. Csiszár I, Körner J. Information Theory: Coding Theorems for Discrete Memoryless Systems. Academic Press: New York, 1982.
35. Csiszár I. Linear codes for sources and source networks: error exponents, universal coding. IEEE Transactions on Information Theory 1982; 28(4):585-592.
36. Urbanke R, Rimoldi B. Lattice codes can achieve capacity on the AWGN channel. IEEE Transactions on Information Theory 1998; 44(1):273-278.
37. Erez U, Zamir R. Achieving 1/2 log(1 + SNR) on the AWGN channel with lattice encoding and decoding. IEEE Transactions on Information Theory 2004; 50(10):2293-2314.
38. Zamir R, Feder M. On lattice quantization noise. IEEE Transactions on Information Theory 1996; 42(4):1152-1159.
39. Erez U, Litsyn S, Zamir R. Lattices which are good for (almost) everything. IEEE Transactions on Information Theory 2005; 51(10):3401-3416.
40. Loeliger HA. Averaging bounds for lattices and linear codes. IEEE Transactions on Information Theory 1997; 43(6): 1767-1773.
41. Kochman Y, Zamir R. Joint Wyner-Ziv/dirty-paper coding by analog modulo-lattice modulation. IEEE Transactions on Information Theory 2008, Submitted for publication; See http://arxiv.org/abs/0801.0815.
42. Cover T, Thomas J. Elements of Information Theory. Wiley-Interscience: New York, 1991.
43. Nazer B, Gastpar M. Computation over Gaussian multiple-access channels. In Proceedings of the IEEE International Symposium on Information Theory (ISIT 2007), Nice, France, 2007.
44. Ahlswede R, Cai N, Li SYR, Yeung RW Network information flow. In IEEE Transactions on Information Theory 2000; 46(4): 1204-1216.
45. Ho T, Karger DR, Médard M, Koetter R. Network coding from a network flow perspective. In Proceedings of the IEEE International Symposium on Information Theory (ISIT 2003), Yokohama, Japan, 2003.
46. Jaggi S, Chou P, Jain K. Low complexity algebraic network codes. In Proceedings of the IEEE International Symposium on Information Theory (ISIT 2003), Yokohama, Japan, 2003.
47. Sanders P, Egner S, Tolhuizen L. Polynomial time algorithms for network information flow. 15th ACM Symposium on Parallel Algorithms and Architectures, 2003; 286-294.
48. Ho T, Medard M, Koetter R, Karger DR, Effros M, Shi I. Leong B. A random linear network coding approach to multicast. IEEE Transactions on Information Theory 2006; 52(10)4413-4430.
49. Gallager RG. A simple derivation of the coding theorem and some applications. IEEE Transactions on Information Theory 1965; 11(1):3-18.
50. Tavildar S, Viswanath P, Wagner AB. The Gaussion many-help-one distributed source coding problem. IEEE Transactions on Information Theory 2008, Submitted for publication.