Papers published by our members:
To be published | 2011 | 2010 | 2009 | 2008 | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001 | 1999 | 1998 | 1997 and before
D.-K. He and E.-H. Yang, "The universality of grammar-based codes for sources with countably infinite alphabets", IEEE Trans. Inform. Theory, Vol. 51, No. 11, pp. 3753-3765, November 2005.
Guixing Wu and En-hui Yang, "Joint watermarking and compression using scalar quantization for maximizing robustness in the presence of additive Gaussian attacks," IEEE Trans. Signal Processing, Vol. 53, No. 2, February 2005.
En-hui Yang and Jianfen Zeng, "Efficient color image encoding with GIF/PNG decoder compatibility," submitted to IEEE Trans. Image Processing for publication, 2004.
En-hui Yang and Da-ke He, "Joint optimization of model selection and coding", submitted to IEEE Trans. Inform. Theory in 2004. [Abstract]
Hsiao-feng Lu, P. Vijay Kumar, and En-hui Yang, "On the input-output weight enumerators of product accumulate codes," IEEE Communications Letters, Vol. 8, No. 8, pp.520-522, August 2004.
John C. Kieffer, W. Szpankowski, and En-hui Yang, "Problems on sequences: Information theory and computer science interface," IEEE Trans. Inform. Theory, Vol. 50, No. 7, pp. 1385-1392, July 2004.
Wei Sun and En-hui Yang, "On the Capacity Regions of Public Multiple-Access Gaussian Watermarking Systems", Lecture Notes in Computer Science 3200, pp.38-51, 2004.
John C. Kieffer and En-hui Yang, "Grammar-based lossless universal refinement source coding," IEEE Trans. Inform. Theory, Vol. 50, No. 7, pp. 1415-1424, July 2004.
Da-ke He and En-hui Yang, "Performance analysis of grammar-based codes revisited", IEEE Trans. Inform. Theory, vol. 50, pp. 1524-1535, 2004
Dianwu Yue and En-hui Yang, "Asymptotically Gaussian weight distribution and performance of multi-dimensional Turbo block codes and product codes," IEEE Trans. Communications, Vol. 52, No.5, pp. 728-736, May 2004.
Yunwei Jia and En-hui Yang, "Context-dependent multilevel pattern matching for lossless image compression," IEEE Trans. Inform. Theory, Vol. 49, No. 12, pp. 3169-3184, December 2003.
En-hui Yang and Da-ke He, "Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-Part II: With context models", IEEE Trans. Inform. Theory, vol. 49, pp. 2874-2894, November, 2003.
Alexei Kaltchenko and En-hui Yang, "Universal compression of ergodic quantum sources," Quantum Information and Computation, Vol.3, No.4, pp. 359-375, July, 2003.
En-hui Yang and Da-ke He, "Huffman coding," The Wiley Encyclopedia of Telecommunications, 2002.
John C. Kieffer and En-hui Yang, "Structured grammar-based codes for universal lossless data compression", Communications in Information and Systems , Vol. 2, No. 1, pp. 29-52, June 2002. (Invited Paper)
En-hui Yang and Da-ke He, "Efficient universal lossless compression algorithms based on a greedy sequential grammar transform--Part two: With context models", accepted pending revisions for publication in IEEE Trans. Inform. Theory, 2001.
En-hui Yang and Zhen Zhang, "The redundancy of source coding with a fidelity criterion--Part II: Coding at a fixed rate level with unknown statistics", IEEE Trans. Inform. Theory, Vol.IT-47, No. 1, pp. 126--145, January 2001.
En-hui Yang, Alexei Kaltchenko, and John C. Kieffer, "Universal lossless data compression with side information by using a conditional MPM grammar transform", IEEE Trans. Inform. Theory, Vol.IT-47, no.6, pp. 2130--2150, September 2001.
Qingchong Lin, En-hui Yang, and Zhen Zhang, "Throughput analysis of CDMA systems using multiuser receivers", IEEE Transactions on Communications, Vol. 49, No. 7, pp. 1192--1202, July 2001.
En-hui Yang and Yunwei Jia, "Universal lossless coding of sources with large or unbounded alphabets", Numbers, Information and Complexity (Ingo Althofer, et al, eds.), Kluwer Academic Publishers, pp. 421-442, February 2000.
John C. Kieffer, En-hui Yang, Gregory Nelson, and Pamela Cosman, "Universal lossless compression via multilevel pattern matching", IEEE Trans. Inform. Theory, Vol.IT-46, No. 4, pp. 1227--1245, July 2000.
John C. Kieffer and En-hui Yang, "Grammar based codes: A new class of universal lossless source codes", IEEE Trans. Inform. Theory, Vol.IT-46, No. 3, pp. 737--754, May 2000.
En-hui Yang and John C. Kieffer, ``Efficient universal lossless compression algorithms based on a greedy sequential grammar transform--Part one: Without context models", IEEE Trans. Inform. Theory, Vol.IT-46, No. 3, pp. 755--777, May 2000.
Bin Zhu, En-hui Yang, and Ahmed H. Tewfik, "Arithmetic coding with dual symbol sets and its performance analysis", IEEE Trans. Image Processing, Vol. 8, No. 12, pp. 1667--1676, December 1999.
En-hui Yang and Zhen Zhang, "The shortest common superstring problem: Average case analysis for both exact matching and approximate matching", IEEE Trans. Inform. Theory, Vol. IT-45, No. 6, pp. 1867--1886, Sept. 1999.
En-hui Yang and Zhen Zhang, "On the redundancy of lossy source coding with abstract alphabets,'' IEEE Trans. Inform. Theory, Vol. IT-45, No. 4, pp. 1092--1111, May 1999.
En-hui Yang and Zhen Zhang, "Variable rate trellis source encoding", IEEE Trans. Inform. Theory, Vol. IT-45, No. 2, pp. 586--608, March 1999.
En-hui Yang and Zhen Zhang, "An on-line universal lossy data compression algorithm via continuous codebook refinement--Part III: Redundancy analysis", IEEE Trans. Inform. Theory, Vol. IT-44, No. 5, pp. 1782-1801, Sept. 1998.
En-hui Yang and John C. Kieffer, "On the performance of data compression algorithms based upon string matching", IEEE Trans. Inform. Theory, Vol. IT-44, No. 1, pp. 47--65, Jan. 1998.
En-hui Yang and Zhen Zhang, "The redundancy of source coding with a fidelity criterion--Part II: Coding at a fixed rate level with unknown statistics", accepted pending revisions for publication in IEEE Trans. Inform. Theory, 1998.
En-hui Yang, Zhen Zhang, and Toby Berger, "Fixed slope universal lossy data compression", IEEE Trans. Inform. Theory, Vol. IT-43, No. 5, pp. 1465--1476, Sept. 1997.
En-hui Yang and John C. Kieffer, "On the redundancy of the fixed database Lempel-Ziv algorithm for $\phi$-mixing sources", IEEE Trans. Inform. Theory, Vol. IT-43, No. 4, pp. 1101--1111, July 1997.
Wen-Shiung Chen, En-hui Yang, and Zhen Zhang, "A new efficient image compression technique with index-matching vector quantization", IEEE Trans. Consumer Electronics, Vol. 43, No.2, pp. 173--182, May 1997.
John C. Kieffer and En-hui Yang, "Ergodic behavior of graph entropy", ERA Amer. Math. Society, Vol. 3, No. 1, pp. 11-16, 1997.
Rudolf Ahlswede, En-hui Yang, and Zhen Zhang, "Identification via compressed data", IEEE Trans. Inform. Theory, Vol. IT-43, No.1, pp. 48--70, Jan. 1997.
Zhen Zhang, En-hui Yang, and Victor K. Wei, "The redundancy of source coding with a fidelity criterion--Part I: Known statistics", IEEE Trans. Inform. Theory, Vol. IT-43, No.1, pp. 71--91, Jan. 1997.
Zhen Zhang and En-hui Yang, "An on-line universal lossy data compression algorithm via continuous codebook refinement--Part II: Optimality for phi-mixing source Models", IEEE Trans. Inform. Theory, Vol. IT-42, No.3, pp. 822--836, March 1996.
En-hui Yang and John C. Kieffer, "Simple universal lossy data compression schemes derived from the Lempel--Ziv algorithm", IEEE Trans. Inform. Theory, Vol. IT-42, No. 1, pp. 239--245, January 1996.
John C. Kieffer and En-hui Yang, "Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity", IEEE Trans. Inform. Theory, Vol. IT-42, No. 1, pp. 29--39, January 1996.
En-hui Yang and Shi-yi Shen, "Distortion program-size complexity with respect to a fidelity criterion and rate distortion function", IEEE Trans. Inform. Theory, Vol. IT-39, pp. 288--292, 1993.
En-hui Yang, "Limit theorems for Chaitin complexity", Chinese Science Bulletin, Vol. 37, No. 21, 1992.
En-hui Yang, "Universal almost sure data compression for abstract alphabets and arbitrary fidelity criterions", Problems of Control and Information theory, Vol.20(6), pp. 397--408, 1991.
En-hui Yang and Shi-yi Shen, "Chaitin complexity, Shannon information content of a single event, and infinite random sequences---Part one", Science in China Series A, Vol. 34, No.10, pp. 1183--1193, 1991.
En-hui Yang and Shi-yi Shen, "Chaitin complexity, Shannon information content of a single event, and infinite random sequences---Part two", Science in China Series A , Vol. 34, No. 11, pp.1307--1319, 1991.
En-hui Yang, "The proof of Levin's conjecture", Chinese Science Bulletin, Vol. 34, No.21, pp.1761--1765, Nov. 1989.
2011 | 2010 | 2009 | 2008 | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001 | 1999 | 1998 | 1997 and before
Jingming Xu and En-hui Yang, "Rate-distortion optimization for MP3 audio coding with complete decoder compatibility," to appear in Proc. of the 2005 IEEE Workshop on Multimedia Signal Processing, Shanghai, China, 2005.
En-hui Yang and Xiang Yu, "On joint optimization of motion compensation, quantization and baseline entropy coding in H.264 with complete decoder compatibility," in Proc. of the 2005 International Conference on Acoustics, Speech, and Signal Processing (ICASSP05), 2005.
En-hui Yang, Da-ke He and John C. Kieffer, �Grammar-based coding: New perspectives,� to appear in Proc. of the 2004 IEEE Inform. Theory Workshop, San Antonio, Texas, U.S.A., 2004. (Invited paper)
Xudong Ma and En-hui Yang, "Low-Density Parity-Check Codes with Fast Decoding Convergence Speed," Proceedings of the 2004 IEEE International Symposium on Information Theory, Chicago, Illinois, 2004, pp. 277 [Abstract]
Da-ke He and En-hui Yang, �On the universality of grammar-based codes for sources with countably infinite alphabets,� in Proc. of the 2003 IEEE Intl. Symp. Inform. Theory, Yokohama, Japan, 2003, pp. 50.
En-hui Yang and Da-ke He, �Context-dependent vs context-free: Performance comparison of grammar-based codes,� in Proc. of the 2003 IEEE Intl. Symp. Inform. Theory, Yokohama, Japan, 2003, pp. 51.
Yunwei Jia and En-hui Yang, "Lossless image compression using context-dependent multilevel 2D pattern matching," in Proc. of the 2003 IEEE Intern. Symp. Inform. Theory, Yokohama, Japan, June 29-July 4, pp. 475-475, 2003.
Alexei Kaltchenko and En-hui Yang, "Invariance of stationary and ergodic properties of a quantum source under memoryless transformations," in Proc. of the 2003 IEEE Intern. Symp. Inform. Theory, Yokohama, Japan, June 29-July 4, pp. 458-458, 2003.
Guixing Wu, En-hui Yang and Wei Sun, "Optimization Strategies for Quantization Watermarking with Application to Image Authentication", IEEE International Conference on Acoustics, Speech, and Signal Processing, Hongkong, April, 2003
Alexei Kaltchenko and En-hui Yang, "Universal compression of classically correlated stationary quantum sources," Proc. of SPIE Vol. 5105 Quantum Information and Computation, pp. 104-115, SPIE, Bellingham, WA, 2003.
Yunwei Jia, En-hui Yang, Da-ke He and Steven Chan, �Speeding up arithmetic coding using greedy re-normalization,� in Proc. of the 2003 IEEE Data Compression Conference, Snowbird, Utah, USA, 2003, p. 432.
En-hui Yang, ``On the joint optimization of model selection and coding,'' Proc. of the 2002 IEEE Intern. Symp. Inform. Theory , Lausanne, Switzerland , June 30 - July 5, pp. 206.
Da-ke He and En-hui Yang, ``The compression performance of grammar-based codes revisited,'' Proc. of the 2002 IEEE Intern. Symp. Inform. Theory , Lausanne, Switzerland , June 30 - July 5, pp. 290.
En-hui Yang and Da-ke He, ``Yang-Kieffer algorithms and 1-D run-length encoding: Compression performance comparison,'' Proc. of the 2001 Canadian Workshop on Information Theory , Vancouver, British Columbia, Canada, June 3-5, pp. 28--31.
Yunwei Jia and En-hui Yang, ``Context-dependent multilevel pattern matching for lossless image compression,'' Proc. of the 2001 Canadian Workshop on Information Theory, Vancouver, British Columbia, Canada, June 3-5, pp. 48--51.
En-hui Yang and Da-ke He, ``Efficient universal lossless data compression algorithms based on a greedy sequential context-dependent grammar transform,'' Proc. of the 2001 IEEE Intern. Symp. Inform. Theory, Washington D.C., USA, June 24--29, pp. 78.
En-hui Yang and Yunwei Jia, ``YK data compression algorithms: Complexity, implementation, and experimental results,'' Proc. of the 2001 IEEE Intern. Symp. Inform. Theory, Washington D.C., USA, June 24--29, pp. 77.
En-hui Yang, ``Grammar-based coding and its applications,'' Proc. of the 22th Annual Meeting of the Canadian Applied and Industrial Mathematics Society , Victoria, British Columbia, Canada, June 7-9, 2001, pp. 39. (invited paper)
John C. Kieffer and En-hui Yang, ``Structurally equivalent grammars in lossless data compression,'' Proc. of the 38th Allerton Conference on Communications, Control, and Computing, Oct.4--6, 2000. (invited paper)
En-hui Yang and Jianghong Guo, ``Lossless image coding via one-dimensional grammar based codes,'' Proc. of the 16th IFIP World Computer Congress(Beijing, China), August 21--25, 2000, pp. 966--972.
En-hui Yang, Alexei Kaltchenko, and John C. Kieffer, ``Universal lossless data compression with side information by using a conditional MPM grammar transform,'' Proc. of the 2000 IEEE Intern. Symp. Inform. Theory, Sorrento, Italy, June 25--30, pp. 298.
En-hui Yang and Yunwei Jia, ``Universal lossless coding of sources with large and unbounded alphabets,'' Proc. of the 2000 IEEE Intern. Symp. Inform. Theory, Sorrento, Italy, June 25--30, pp. 16.
John C. Kieffer, Ross Stites, and En-hui Yang, ``A universal lossless resolution scalable progressive image code,'' Proc. of the 2000 IEEE Intern. Symp. Inform. Theory, Sorrento, Italy, June 25--30, pp. 295.
J. C. Kieffer, Philippe Flajolet, and E.-H. Yang, ``Data compression via binary decision diagrams,'' Proc. of the 2000 IEEE Intern. Symp. Inform. Theory, Sorrento, Italy, June 25--30, pp. 296.
Ashish Banerji and En-hui Yang, ``Applications of YK algorithms to the Internet transmission of web-data: Implementation issues and modifications,'' Proc. DCC'2000(Snowbird, Utah), USA, March 28--30, pp. 546, 2000.
John C. Kieffer and En-hui Yang, ``Lossless data compression via guided approximate bisections,'' Proc. of the 34th Annual Conference on Information Sciences and Systems, Princeton, USA, March 15--17, pp. TP6-1--TP6-6, 2000. (invited paper)
J. K. Lanctot, Ming Li, and En-hui Yang, ``Estimating DNA sequence entropy,'' Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms(SODA'2000), San Francisco, California, USA, Jan. 9--11, 2000, pp. 409--418.
En-hui Yang and John C. Kieffer, ``Universal source coding theory based on grammar transforms,'' Proc. of the 1999 IEEE Information Theory and Communications Workshop, Kruger National Park, South Africa, June 20-25, pp. 75--77. (invited paper)
En-hui Yang and Yunwei Jia, ``Efficient universal compression of integer sequences by using multilevel arithmetic coding,'' Proc. of the 1999 Canadian Workshop on Information Theory, Kingston, Ontario, Canada, June 15-18, pp. 40--43.
John C. Kieffer and En-hui Yang, ``A simple technique for bounding the pointwise redundancy of the 1978 Lempel-Ziv algorithm,'' Proc. DCC'99(Snowbird, Utah), pp. 434-441.
En-hui Yang and Zhen Zhang, ``Abstract alphabet source coding theorem revisited: Redundancy analysis,'' Proc. of the 1998 IEEE Intern. Symp. Inform. Theory, MIT, Boston, USA, August 16-21, pp. 69.
En-hui Yang and Zhen Zhang, ``The redundancy of universal fixed rate source coding,'' Proc. of the 1998 IEEE Intern. Symp. Inform. Theory, MIT, Boston, USA, August 16-21, pp. 172.
En-hui Yang and Zhen Zhang, ``Variable rate trellis source encoding,'' Proc. of the 1998 IEEE Intern. Symp. Inform. Theory, MIT, Boston, USA, August 16-21, pp. 369.
John C. Kieffer and En-hui Yang, ``Redundancy of MPM data compression system,'' Proc. of the 1998 IEEE Intern. Symp. Inform. Theory, MIT, Boston, USA, August 16-21, pp. 136.
John C. Kieffer and En-hui Yang, ``Design of context-free grammars for lossless data compression,'' Proc. of the 1998 IEEE Information Theory Workshop, Killarney, Ireland, June 22--26, pp. 84--85.
John C. Kieffer and En-hui Yang, ``Lossless data compression algorithms based on substitution tables,'' Proc. of the 1998 Canadian Conference on Electrical and Computer Engineering(Waterloo, Ontario), Vol. 2, pp. 629--632, May 24--28, 1998.
En-hui Yang and Zhen Zhang, ``On the analysis and design of variable rate trellis source codes,'' Proc. of the 1998 Canadian Conference on Electrical and Computer Engineering(Waterloo, Ontario), Vol. 2, pp. 541--544, May 24--28, 1998.
John C. Kieffer, En-hui Yang, Trevor Park, and Sidney Yakowitz, ``Complexity of preprocessor in MPM data compression systems,'' Proc. DCC'98(Snowbird, Utah), pp. 554.
En-hui Yang and Zhen Zhang, ``Abstract alphabet source coding theorem revisited,'' 1997 Symposium on Information Theory at the International Conference on Statistical Inference, Combinatorics, and Related Areas, Dec. 18--21, 1997, Varanasi, India, pp. 75. (invited paper)
Bin Zhu, En-hui Yang, and Ahmed H. Tewfik , ``Dual set arithmetic coding and its applications to image coding,'' EUSIPCO-96, VIII European Signal Proc. Conf., Trieste, Italy, Vol. 1, pp. 324-327, Sept. 1996.
En-hui Yang and Zhen Zhang, ``The Gold-Washing data compression algorithm(III): Redundancy analysis,'' Proc. of the 1996 IEEE Workshop on Inform. Theory, Haifa, Israel. (invited paper)
Bin Zhu, En-hui Yang, A. H. Tewfik, and John C. Kieffer, ``Efficient coding of wavelet trees and its applications to image coding,'' Proc. 1996 SPIE Conf. on Visual Communications and Image Processing(Orlando, FL, USA), Vol. 2727, pp. 512--523.
Rudolf Ahlswede, En-hui Yang, and Zhen Zhang, ``Identification via compressed data(II),'' Proc. of the 1995 IEEE Intern. Symp. Inform. Theory, Whistler, B.C., Canada, pp. 69. (long talk)
Zhen Zhang, En-hui Yang, and Victor K. Wei, ``On the redundancy of lossy source coding,'' Proc. of the 1995 IEEE Workshop on Inform. Theory, Rydzyna, Poland, pp. 31-32. (invited paper)
En-hui Yang and John C. Kieffer, ``String matching data compression algorithms: Performance analysis,'' Proc. of the 33th Allerton Conference on Communications, Control, and Computing, pp. 881--890, Oct., 1995. (invited paper)
Qingchong Liu, En-hui Yang, and Zhen Zhang, ``A fixed slope universal sequential algorithm for lossy source coding based on the Gold-washing mechanism,'' Proc. of the 33th Allerton Conference on Communications, Control, and Computing, pp. 466--474, Oct., 1995.
Wen-shiung Chen, En-hui Yang, and Zhen Zhang, ``A variant of address vector quantization for image compression using lossless conditional entropy coding,'' Proc. ICASSP'95 (Detroit, USA), May, pp. 2483--2486.
Wen-shiung Chen, Zhen Zhang, and En-hui Yang, ``A hybrid adaptive vector quantizer for image compression via the Gold-washing mechanism,'' Proc. 1995 SPIE Visual Communication and Image Processing(Taipei, Taiwan), Vol. 2501, pp. 635--646.
Wen-shiung Chen, Zhen Zhang, En-hui Yang, and Sheau-Shong Bor, ``A modified stack search algorithm for VQ-based tree encoding,'' Proceedings of the 1995 IEEE Global Telecommunications conference(Singapore), Vol. 1, pp. 462--467.
Zhen Zhang, En-hui Yang, and Victor K. Wei, ``On the redundancy of lossy source coding(II),'' Proc. of the 1995 IEEE Intern. Symp. Inform. Theory, Whistler, B.C., Canada, pp. 190. (long talk)
En-hui Yang, Zhen Zhang, and Toby Berger, ``Fixed-slope universal algorithms for lossy source coding via lossless codeword length functions,'' Proc. of the 1995 IEEE Intern. Symp. Inform. Theory, Whistler, B.C., Canada, pp. 79.
Zhen Zhang and En-hui Yang, ``The gold-washing algorithm(II): Optimality for $\phi$-mixing sources,'' Proc. of the 1995 IEEE Intern. Symp. Inform. Theory, Whistler, B.C., Canada, pp. 81.
Rudolf Ahlswede, En-hui Yang, and Zhen Zhang, ``Identification via compressed data,'' Proc. of the 1994 IEEE-IMS Workshop on Inform. Theory and Statistics, Virginia, USA, pp. 31. (invited paper)
John C. Kieffer and En-hui Yang, ``On the OPTA function for lossless compression of individual sequences via recursive sequential codes,'' Proc. of the 1994 IEEE Intern. Symp. Inform. Theory, Trondheim, Norway, pp.7.
En-hui Yang, ``Kieffer's Sample Converses for source coding,'' Proc. of the 1993 IEEE Int. Symposium on Inform. Theory, San Antonio, TX, USA, pp. 337.
En-hui Yang, ``Generalized limit theorems for program-size complexity,'' (in Chinese) Proc. of the First Young Scientists Conf. sponsored by Chinese Association of Science and Technology, pp. 124--128, Beijing, China, 1992.
En-hui Yang, ``Kolmogorov complexity and universal coding,'' (in Chinese) Proc. of China Conf. on Inform. Theory and Commun. Theory, Oct. 1989.
Copyright 2004-2010 Multicom Research Lab.
Currently Maintained by Jin Meng
Design by Marta Sitek
Last updated on May 20, 2010