Abstracts of talks, Fall 2005

Information and Coding Theory Seminar

Abstracts of talks

Fall 2005

9/19 Alexander Barg (UMD), Error exponent of 'dirty paper coding'

Abstract: A bound on the error exponent for transmission over the Gaussian channel with side information at the encoder (Costa's problem) will be derived.

9/26 Raymond Yeung (CU HongKong), Network Coding

Abstract: Network coding, a new concept in network communications, is generating much interest in information theory, coding theory, networking, wireless communications, cryptography, and computer science. Consider a point-to-point communication network on which a number of information sources are to be multicast to certain sets of destination nodes. The problem is to characterize the maximum possible thruputs. Contrary to one's intuition, network coding theory reveals that it is in general not optimal to regard the information to be multicast as a "fluid'' which can simply be routed or replicated. Rather, by employing coding at the nodes, bandwidth can in general be saved. In this talk, we will introduce this subject and report the latest research developments.

10/3 Ahmed Sadek (UMD), Diversity-Multiplexing Tradeoff

References: [1] Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels, Lizhong Zheng; Tse, D.N.C.; IEEE Transactions on Information Theory, Volume 49, Issue 5, May 2003 Page(s):1073 - 1096

[2] Diversity-multiplexing tradeoff in multiple-access channels Tse, D.N.C.; Viswanath, P.; Lizhong Zheng; IEEE Transactions on Information Theory, Volume 50, Issue 9, Sept. 2004 Page(s):1859 - 1874

[3] Achievable diversity-vs-multiplexing tradeoffs in half-duplex cooperative channels, Azarian, K.; El Gamal, H.; Schniter, P.; IEEE Information Theory Workshop, 2004.

10/10 Sirin Nitinawarat (UMD), Weight Distribution of LDPC Codes

References: [1] Changyan Di, Tom Richardson, Rudiger Urbanke, Weight Distribution of LDPC codes, preprint

[2] Bollobas, Random Graphs pp. 50-55 (1 2 3)

[3] Alon Orlitsky, et al, Stopping Set Distribution of LDPC Code Ensembles, IEEE Transaction on Information Theory, Vol. 51, no.3 march 2005

10/24 Alexander Barg (UMD), A linear-algebraic approach to linear programming bounds of coding theory

Abstract: A linear-algebraic approach will be developed to the main asymptotic bounds on the size of codes. New proofs will be given for the best known asymptotic bounds on the size of binary codes, binary constant-weight codes, and spherical codes. Joint work with Dmitry Nogin (IPPI RAS)

10/31 Alkan Soysal (UMD), Duality of Gaussian multiple-access and broadcast channels

References: [1] "On the duality of Gaussian multiple-access and broadcast channels", Jindal, N.; Vishwanath, S.; Goldsmith, A.; Information Theory, IEEE Transactions on Volume 50, Issue 5, May 2004 Page(s):768 - 783

[2] "Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality", Viswanath, P.; Tse, D.N.C.; Information Theory, IEEE Transactions on Volume 49, Issue 8, Aug. 2003 Page(s):1912 - 1921

[3] "Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels", Vishwanath, S.; Jindal, N.; Goldsmith, A.; Information Theory, IEEE Transactions on Volume 49, Issue 10, Oct. 2003 Page(s):2658 - 2668

11/7 N. Prasanth Anthapadmanabhan (UMD), Linear network coding

References:[1] S.-Y. R. Li, R. W. Yeung and N. Cai, "Linear network coding," IEEE Trans. Inform. Theory, vol. 49, pp. 371-381, Feb 2003.

[2] R. Ahlswede, N. Cai, S.-Y. R. Li and R. W. Yeung, "Network information flow," IEEE Trans. on Information Theory, vol. 46, pp.1004-1016, Jul 2000.

11/14 Shabnam Shafiee (UMD), Compression of encrypted data

References: [1] M. Johnson, P. Ishwar, V. M. Prabhakaran, D. Schonberg, and K.Ramchandran, "On Compressing Encrypted Data," IEEE Transactions on Signal Processing, Supplement on Secure Media I, Volume: 52, Issue: 10, October2004, Pages 2992 - 3006.

[2] D. Schonberg, S. C. Draper, and K. Ramchandran, "On Blind Compression of Encrypted Correlated Data Approaching the Source Entropy Rate," 43rd Annual Allerton Confrence, Monticello, IL, September 2005.

[3] D. Schonberg, S. C. Draper, and K. Ramchandran, "On Blind Compression of Encrypted Data Approaching the Source Entropy Rate," Proc. European Signal Processing Conference, September 2005.

11/21 Punarbasu Purkayastha (UMD), Nested linear/lattice codes for structured multiterminal binning

Reference: R.Zamir, S.Shamai and U.Erez, "Nested Linear/Lattice Codes for Structured Multiterminal Binning", IEEE Transactions on Information Theory, special A.D. Wyner issue, pp. 1250-1276, June 2002.

11/28 Karim Seddik (UMD), Cooperative strategies and capacity theorems for relay networks

Reference: G. Kramer, M. Gastpar, and P. Gupta, "Cooperative strategies and capacity theorems for relay networks", IEEE Transactions on Information Theory, 51(9):3037-3063, September 2005.

12/12 Andrew Duggan (UMD), Communicating via a Processing Broadcast Satellite;
Ahmed Ibrahim (UMD), Duality Between Source Coding and Channel Coding and its Extension to the Side Information Case

References: 1. Wyner/Wolf/Willems, "Communicating via a Processing Broadcast Satellite",
IEEE IT Trans, June 2002, pp 1243 - 1249.
2. S. Pradhan, J. Chou, K. Ramachandran, "Duality Between Source Coding and
Channel Coding and its Extension to the Side Information Case," IEEE IT
Trans, vol. 49, no. 5, pp. 1181 - 1203, May 2003.

12/19 Wei Kang & Nan Liu (UMD), Capacity Region of Gaussian MIMO Broadcast Channel

Reference: Weingarten/Steinberg/Shamai, "Capacity Region of Gaussian MIMO Broadcast
Channel"