Department of EECS, The University of Tennessee at Knoxville / Aug. 2014 -
Adjunct Assistant/Associate Professor
Department of Electrical Engineering, Columbia University / Aug. 2011 - Dec. 2013
Member of Technical Staff-Research
AT&T Labs-Research, Florham Park (Bedminster), NJ / Oct. 2007 - Jul. 2014
EPFL, Lausanne, Switzerland / Sep. 2005 - Sep. 2007
Cornell University, Ithaca, NY
Ph.D. Electrical and Computer Engineering / Aug. 2005
Tsinghua University, Beijing, China
Bachelor of Engineering (BE), Electronic Engineering / Jul. 2000
AT&T Key Contributor Award
For technical contribution in AT&T / 2010, 2011, 2013
Liu-Memorial Award, Cornell University
For excellence in graduate study and research / 2004
Characterizing the rate-region of the (4,3,3) exact-repair regenerating codes
C. Tian, IEEE Journal on Secelected Areas in Communications, May 2014.
Layered exact-repair regenerating codes via embedded erasure correction and block designs
C. Tian, B. Sasidharan, V. Aggarwal, P. Vijay Kumar and V. Vaishampayan, accepted, IEEE Trans. Inform. Theory.
Optimality and approximate optimality of source-channel separation in networks
C. Tian, J. Chen, S. N. Diggavi and S. Shamai, IEEE Trans. Inform. Theory, Feb. 2014
The achievable distortion region of sending a bivariate Gaussian source on the Gaussian broadcast channel
C. Tian, S. N. Diggavi and S. Shamai, IEEE Trans. Inform. Theory, Oct. 2011
Approximating the Gaussian multiple description rate region under symmetric distortion constraints
C. Tian, S. Mohajer and S. N. Diggavi, IEEE Trans. Inform. Theory, Aug. 2009
We recently developed a computational approach to identify and prove information-theoretical limits, whose potential is yet to be fully explored. Here is a collection of results on several data storage and communication problems. Contributions are welcome. If you have a burning question and think this approach may be helpful, please contact me.
To see the results on the SCITL page.
Quantcast QFS is designed to better accommodate the map-reduce framework by taking into account of the more recent hardware architecture. It originally supports on up to 3 parities in erasure code setting. In this project, we add more flexible erasure codes to allow more than 3 parities.
Implmentation of a set of regenerating codes and locally repairable codes for distributed data storage.