Terence Chan's Publications

1. T. H. Chan, S. Hranilovic, F. R. Kschischang, Capacity-achieving probability measure for conditionally Gaussian channels with bounded inputs, IEEE Trans. on Inform. Theory, vol. 51, pp. 2073 - 2088, June 2005.
2. M. Ardakani, T.H. Chan, and F.R. Kschischang, EXIT-chart properties of the highest-rate LDPC code with desired convergence behavior, IEEE Communications Letters , vol. 9, pp. 52-54, Jan 2005.
3. T. H. Chan, Balanced information inequalities , IEEE Trans. on Inform. Theory , vol. 49, pp. 3261 - 3267, December 2003.
4. T. H. Chan, R. W. Yeung, On a relation between information inequalities and group theory , IEEE Trans. on Inform. Theory , vol. 48, pp. 1992-1995, July 2002.
5. T. H. Chan, A combinatorial approach to information inequalities , Communications in Information and Systems , vol. 1, No. 3, pp. 1-14, September 2001.

1. T. H. Chan, Characterization of communication complexity - an Information theoretic approach , submitted to 2006 IEEE Int. Symp. on Inform. Theory.
2. T. H. Chan, Capacity region of cyclic networks , to be submitted to IEEE Int. Symp. on Inform. Theory .
3. T. H. Chan, R. W. Yeung, On divergence minimization and probabilistic inference, submitted to IEEE Trans. on Inform. Theory .
4. T.H. Chan, Efficiently decodable network codes using tree-based multicast transmission scheme, Technical Report CS-2005-03 , University of Regina, Canada.
5. T.H. Chan, Rainbow Network Flow Problem using Network Coding, in preparation.
6. T.H. Chan, Capacity Region of Secure Network Codes, in preparation.

1. T.H. Chan, On the optimality of group network codes, Proc. 2005 IEEE Int. Symp. on Inform. Theory , Adelaide, Australia, pp.1992-1996, September 2005.
2. T.H. Chan, Capacity region of probabilistic network codes, Proc. 2005 Canadian Workshop on Information Theory , Montreal, Canada, pp.167-170, June 2005.
3. T. H. Chan, F. R. Kschischang, On the discreteness of the capacity-achieving probability measure of signal-dependent Gaussian channels, Proc. 2004 IEEE Int. Symp. on Inform. Theory , Chicago, USA, pp.348, July 2004.
4. T. H. Chan, F. R. Kschischang, On the discreteness of the capacity-achieving probability measures of signal-dependent Gaussian channels, Proc. 22nd Biennial Symp. on Communications, Kingston, Canada, pp.124-126, May 2004.
5. T. H. Chan, S. Draper, Simple erasure resilient linear network codes, Proc. 22nd Biennial Symp. on Communications, Kingston, Canada, pp.182-184, May 2004.
6. T. H. Chan, F. R. Kschischang, Capacity-achieving probability measure of an input-bounded optical channel with signal-dependent noise, Proc. 41st Annual Allerton Conference on Communication, Control and Computing, Oct. 2003.
7. T. H. Chan, S. Hranilovic, F. R. Kschischang, Capacity-achieving probability measure of an input-constrained vector Gaussian channel, Proc. 2003 IEEE Int. Symp. on Inform. Theory, Yokohama, Japan, pp. 371, July 2003.
8. T. H. Chan, S. Hranilovic, F. R. Kschischang, Capacity-achieving probability measure of an input-constrained vector Gaussian channel, Proc. 2003 Canadian Workshop on Information Theory, Waterloo, Canada, pp.32-35, May 2003.
9. M. Ardakani, T. H. Chan, Frank R. Kschischang, Flatness: A sufficient condition for achieving the capacity of one-dimensional decoding schemes, Proc. 2003 Canadian Workshop on Information Theory, Waterloo, Canada, pp.143-146, May 2003.
10. T. H. Chan, On balanced information inequalities, Proc. 2002 The International Symposium on Information Theory and its Applications (ISITA 2002), Xian, China, October 2002.
11. T. H. Chan, R. W. Yeung, On maximum likelihood estimation and divergence minimization, Proc. 2002 IEEE Int. Symp. on Inform. Theory, Lausanne, Switzerland, pp. 158, July 2002.
12. T. H. Chan, R. W. Yeung, On factorization of positive functions, Proc. 2001 IEEE Int. Symp. on Inform. Theory, Washington D.C., USA, pp. 44, July 2001.
13. T. H. Chan and R. W. Yeung, A group-theoretic approach to information inequalities, Proc. 2000 IEEE Int. Symp. on Inform. Theory, Sorrento, Italy, pp. 492, July 2000.
14. R. W. Yeung and T. H. Chan, Information inequalities, conditional independence and groups, Proc. 2000 Conference on Information Sciences and Systems, Princeton University, WP6 23-26, March 2000.
15. T. H. Chan and R. W. Yeung, A combinatorial approach to information inequalities, Proc. 1999 Info. Theory and Networking Workshop, Metsovo, Greece, pp. 63, June 1999.

- Foreword, A First Course in Information Theory

The closing chapter (i.e., Chapter 16) linking entropy to the theory of groups is mouthwateringly provocative, having the potential to become a major contribution of information theory to this renowned branch of mathematics and mathematical physics.

Toby Berger (IEEE Fellow, Recipient of Shannon Award in 2002)

- Book Review, IEEE Trans. on Information Theory, vol. 49, p.1869, July 2003.

Chapters 12, 13, 14, and 16 are centered around a recent but conceptually fundamental problem about information measures .... The mentioned chapters contain results pertinent to this - apparently very hard - problem. Determining Γ_n^* would amount to determining all information-theoretic inequalities that can be reduced to the non-negativity of some linear combination of joint entropies. ... Most remarkably, in Section 16.3, an equivalent characterization of the set Γ_n^* is found in terms of algebraic concepts, viz. finite groups and their sub-groups.

Imre Csiszar (IEEE Fellow, Recipient of Shannon Award in 1996)