Sudeep Kamath's Homepage

Sudeep Kamath PhD. student Electrical Engineering and Computer Science Department University of California, Berkeley Email: <my_first_name> at eecs dot berkeley dot edu

About me

I joined the EECS department at UC Berkeley as a graduate student in August 2008. I am co-advised by Prof. David Tse and Prof. Venkat Anantharam.

Publications

• Venkat Anantharam, Amin Aminzadeh Gohari, Sudeep Kamath, Chandra Nair
  On Maximal Correlation, Hypercontractivity, and the Data Processing Inequality studied by Erkip and Cover [arXiv]
  (To be submitted).

• Sudeep Kamath, David Tse
  On the Generalized Network Sharing bound and edge-cut bounds for network coding [pdf]
  (To appear at International Symposium on Information Theory 2013, Istanbul, Turkey).

• Sudeep Kamath, Venkat Anantharam
  Non-interactive Simulation of Joint Distributions: The Hirschfeld-Gebelein-Rényi Maximal Correlation and the Hypercontractivity Ribbon [pdf] [slides]
  Proceedings of the 50th Annual Allerton Conference on Communications, Control and Computing 2012, Monticello, Illinois.

• Sudeep Kamath, Sreeram Kannan, Pramod Viswanath
  Wireless Networks Under Symmetric Demands [pdf]
  International Symposium on Information Theory 2012, MIT, Cambridge, MA.

• Sudeep Kamath, Pramod Viswanath
  An information-theoretic meta-theorem on edge-cut bounds [pdf]
  International Symposium on Information Theory 2012, MIT, Cambridge, MA.

• I-Hsiang Wang, Sudeep Kamath, David Tse
  Two Unicast Information Flows over Linear Deterministic Networks [pdf] [arXiv]
  International Symposium on Information Theory 2011, St. Petersburg, Russia.

• Sudeep Kamath, Urs Niesen, Piyush Gupta
  The capacity per unit energy of large wireless networks [pdf]
  International Symposium on Information Theory 2011, St. Petersburg, Russia.

• Sudeep Kamath, David Tse, Venkat Anantharam
  Generalized Network Sharing outer bound and the Two-Unicast problem [pdf]
  International Symposium on Network Coding (NetCod) 2011, Beijing, China.

• Sudeep Kamath, Venkat Anantharam
  A new dual to the Gács-Körner common information defined via the Gray-Wyner system [pdf] [slides]
  Proceedings of the 48th Annual Allerton Conference on Communications, Control and Computing 2010, Monticello, Illinois.

• Sudeep Kamath, D. Manjunath
  On Distributed Function Computation in Structure-Free Random Networks [pdf]
  International Symposium on Information Theory 2008, Toronto, Canada.

Master's Thesis (2011)

• Sudeep Kamath
  Generalized Network Sharing outer bound and the Two-Unicast problem [pdf]