Books and Proceedings:
[1] E.-H. Yang and B. J. Frey, Eds. Proceedings of the Eighth Canadian Workshop on Information Theory. The Canadian Society for Information Theory, Ottawa, Ontario, Canada, 2003.
Refereed Journal Papers:
[2] J. C. Kieffer and E.-H. Yang, "Survey of grammar-based data structure compression," IEEE BITS the Information Theory Magazine, pp. 1-12, Sept. 2022, https://doi.org/10.1109/MBITS.2022.3210891.
[3] E.-H. Yang, H. Amer, and Y. Jiang, "Compression helps deep learning in image classification," Entropy, 2021, 23, 881 (19 pages). https://doi.org/10.3390/e23070881.
[4] X. Wang, E.-H. Yang, D.-K. He, L. Song, and X. Yu, \Rate distortion optimization: A joint framework and algorithms for random access hierarchical video coding," IEEE Trans. on Image Processing, Vol. 29, pp. 9458-9469, Oct. 2020.
[5] H. Amer and E.-H. Yang, \Adaptive quantization parameter selection for low-delay HEVC via temporal propagation length estimation," Signal Processing: Image Communication, Vol. 84, Mar. 2020 (12 pages).
[6] J. He, E.-H. Yang, F. Yang, and K. Yang, "Adaptive quantization parameter selection algorithm for H.265/HEVC based on inter-frame dependency," IEEE Trans. Circuits Syst. Video Technol., Vol. 28, No. 12, pp. 3424-3436, Dec. 2018.
[7] H. Yin, H. Cai, E.-H.Yang, Y.Zhou, and J. Wu, "An efficient all-zero block detection algorithm for high efficiency video coding with RDOQ," Signal Processing: Image Communication, Vol. 60, pp. 79-90, Feb. 2018.
[8] Y. Fang, V. Stankovic, S. Cheng, and E.-H. Yang, "Analysis on tailed distributed arithmetic codes for uniform binary sources," IEEE Trans Commun., Vol. 64, No. 10, pp. 4305-4319, Oct. 2016 (15 double column pages).
[9] N. Hu and E.-H. Yang, Erratum to \Fast Mode Selection for HEVC Intra-Frame Coding With Entropy Coding Refinement Based on a Transparent Composite Model", IEEE Trans. Circuits Syst. Video Technol., Vol. 26, DOI: 10.1109/TCSVT.2016.2555242, April 25, 2016 (3 double column pages).
[10] Y. Fang, V. Stankovic, S. Cheng, and E.-H. Yang, "Hamming distance spectrum of DAC codes for equiprobable binary sources," IEEE Trans Commun., Vol. 64, No. 3, pp. 1232-1245, Mar. 2016
[11] E.-H. Yang and J. Meng, "New non-asymptotic random channel coding theorems for structured codes," IEEE Trans. on Information Theory, Vol. 61, No. 9, pp. 4534-4553, Sept. 2015.
[12] N. Hu and E.-H. Yang, "Fast mode selection for HEVC intra frame coding with entropy coding refinement based on transparent composite model," IEEE Trans. on Circuits and Systems for Video Technology, Vol. 25, No.9, pp. 1521-1532, Sept. 2015.
[13] H. Yin, E.-H. Yang, and X. Yu, "Fast soft decision quantization with adaptive preselection and dynamic trellis graph," IEEE Trans. on Circuits and Systems for Video Technology, Vol. 25, No. 8, pp. 1362-1375, Aug. 2015.
[14] C. Sun and E.-H. Yang, "An efficient DCT-based image compression system based on Laplacian transparent composite model," IEEE Trans. on Image Processing, Vol. 24, No. 3, pp. 886-900, Mar. 2015.
[15] E.-H. Yang, C. Sun, and J. Meng, "Quantization table design revisited for image/video coding," IEEE Trans. on Image Processing, Vol. 23, No. 11, pp. 4799-4811, Nov. 2014.
[16] J. Meng. and E.-H. Yang, "Constellation and rate selection in adaptive modulation and coding based on finite blocklength analysis and its application to LTE," IEEE Trans. on Wireless Communications, Vol. 13 , No. 10 , pp. 5496-5508, Oct. 2014.
[17] S. Yang, S. Ho, J. Meng, and E.-H. Yang, "Capacity analysis of linear operator channels
over finite fields," IEEE Trans. on Information Theory, Vol. 60, No. 8, pp. 4880- 4901, Aug. 2014.
[18] N. Hu and E.-H. Yang “Fast motion estimation based on confidence interval,” IEEE Trans. on Circuits and Systems for Video Technology, Vol. 24, No. 8, pp. 1310 – 1322, Aug. 2014.
[19] E.-H. Yang, X. Yu, J. Meng, and C. Sun, “Transparent composite model for DCT coefficients: Design and analysis,” IEEE Transactions on Image Processing, Vol. 23, No. 3, pp. 1303 – 1316, Mar. 2014.
[20] J. Zhang, E.-H. Yang, and J. C. Kieffer, “A universal grammar-based code for lossless compression of binary trees,” IEEE Trans. on Information Theory, Vol. 60, No. 3, pp. 1373 – 1386, Mar. 2014.
[21] E.-H. Yang, L. Zheng, and D.-K. He, “On the information theoretic performance com- parison of causal video coding and predictive video coding,” IEEE Trans. on Infor-mation Theory, Vol. 60, No. 3, pp. 1428 – 1446, Mar. 2014.
[22] J. Ho and E.-H. Yang, “Designing optimal multiresolution quantizers with error de- tecting codes,” IEEE Trans. on Wireless Communications, Vol. 12, No. 7, pp. 3588
– 3599, July 2013 (12 double-column pages)
[23] J. Meng and E.-H. Yang, “Interactive encoding and decoding based on binary LDPC codes with syndrome accumulation,” IEEE Trans. on Information Theory, Vol. 59, No. 9, pp. 3068–3103, May 2013 (36 double-column pages).
[24] J. Meng, E.-H. Yang, and D.-K. He, “Linear interactive encoding and decoding schemes for lossless source coding with decoder only side information,” IEEE Trans. on Infor-mation Theory, Vol. 57, No. 8, pp. 5281–5297, August 2011.
[25] E.-H. Yang, L. Zheng, D.-K. He, and Z. Zhang, “Rate distortion theory for causal video coding: Characterization, computation algorithm, and comparison,” IEEE Trans. onInformation Theory, Vol. 57, No. 8, pp. 5258–5280, August 2011.
[26] James Ho and E.-H. Yang, “Cross layer coding optimization for mobile IPTV delivery,”
IEEE COMSOC MMTC E-Letter, Vol. 6, No. 1, pp.52–54, January 2011.
[27] X. Yu, H. Wang, and E.-H. Yang, “Design and analysis of optimal noisy channel quantization with random index assignment,” IEEE Trans. Information Theory, Vol. 56, No. 11, pp. 5796–5804, Nov. 2010.
[28] E.-H. Yang and D.-K. He, “Interactive encoding and decoding for one way learning: Near lossless recovery with side information at the decoder,” IEEE Trans. Information Theory, Vol. 56, No. 4, pp. 1808–1824, April 2010.
[29] H. Wang, E.-H. Yang, Z. Zhao, and W. Zhang, “Spectrum sensing in cognitive radio using goodness of fi testing,” IEEE Transactions on Wireless Communications, Vol.8, No. 11, pp. 5427–5430, Nov. 2009.
[30] D.-K. He, L. A. Lastras-Montano, E.-H. Yang, A. Jagmohan, and J. Chen, “On the redundancy of Slepian-Wolf coding,” IEEE Trans. Information Theory, Vol. 55, No. 12, pp. 5607–5627, Dec. 2009.
[31] J. Chen, D.-K. He, A. Jagmohan, L. A. Lastras-Montano, and E.-H. Yang, “On the linear codebook-Level duality between Slepian-Wolf coding and channel coding,” IEEETrans.Information Theory, Vol. 55, No. 12, pp. 5575–5590, Dec. 2009.
[32] J. She, X. Yu, P.-H. Ho, and E.-H. Yang, “A cross-layer design framework for ro- bust IPTV services over IEEE 802.16 networks,” IEEE Journal on Selected Areas in Communications, Vol. 27, No. 2, pp. 235–245, Feb. 2009.
[33] E.-H. Yang and Longji Wang, “Joint optimization of run-length coding, Huffman cod- ing and quantization table with complete baseline JPEG decoder compatibility,” IEEETrans. Image Processing, Vol. 18, No. 1, pp. 63–74, January 2009.
[34] X. Yu, E.-H. Yang, and H. Wang, “Down-sampling design in DCT domain with arbi- trary ratio for image/video transcoding,” IEEE Trans. Image Processing, Vol. 18, No. 1, 75–89, January 2009.
[35] E.-H. Yang and X. Yu, “Soft decision quantization for H.264 with main profi com- patibility,” IEEE Transactions on Circuits and Systems for Video Technology, Vol. 19, No. 1, pp. 122–127, January 2009.
[36] E.-H. Yang, D.-K. He, T. Uyetmasu, and R. W. Yeung, “Universal multiterminal source coding algorithms with asymptotically zero feedback: Fixed database case,” IEEE Trans. Information Theory,Vol. 54, No. 12, pp. 5575–5590, December 2008.
[37] E.-H. Yang and W. Sun, “On information embedding when watermarks and covertexts are correlated,” IEEE Trans. Information Theory, Vol. 54, No. 7, pp. 3340–3345, July 2008.
[38] Y. Jia, E.-H. Yang, D.-K. He, and S. Chan, “A greedy re-normalization method for arithmetic coding,” IEEE Trans. Communications, Vol. 55, No. 8, pp. 1494–1503, August 2007.
[39] E.-H. Yang and X. Yu, “Rate distortion optimization for H.264 inter-frame video cod- ing: A general framework and algorithms,” IEEE Trans. on Image Processing, Vol.16, No.7, pp. 1774–1784, July 2007.
[40] Z. Wang, G. Wu, H. R. Sheikh, E. P. Simoncelli, E.-H. Yang, and A. C. Bovik, “Quality aware images,” IEEE Trans. Image Processing, Vol. 15, No. 6, pp. 1680–1689, 2006.
[41] D.-K. He and E.-H. Yang, “The universality of grammar-based codes for sources with countably infi alphabets,” IEEE Trans. Inform. Theory, Vol. 51, No. 11, pp. 3753–3765, November 2005.
[42] G. Wu and E.-H. 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, pp. 834–844, February 2005.
[43] W. Sun and E. H. Yang, “Closed-form formulas for private watermarking capacities of Laplacian sources with the magnitude-error distortion measure and under Additive attacks,” LectureNotes in Computer Science (LNCS) 3710, pp. 361–371, 2005.
[44] H.-F. Lu, P. V. Kumar, and E.-H. Yang, “On the input-output weight enumerators of product accumulate codes,” IEEE Communications Letters, Vol. 8, No. 8, pp. 520–522, August 2004.
[45] J. C. Kieffer, W. Szpankowski, and E.-H. Yang, “Problems on sequences: Information theory and computer science interface,” IEEE Trans. Inform. Theory, Vol. 50, No. 7, pp. 1385–1392, July 2004.
[46] W. Sun and E.-H. Yang, “On the Capacity Regions of Public Multiple-Access Gaussian Watermarking Systems”, LectureNotes in Computer Science 3200, pp.38–51, 2004.
[47] J. C. Kieffer and E.-H. Yang, “Grammar-based lossless universal refinement source coding,” IEEE Trans. Inform. Theory, Vol. 50, No. 7, pp. 1415–1424, July 2004.
[48] D.-K. He and E.-H. Yang, “Performance analysis of grammar-based codes revisited,”
IEEE Trans. Inform. Theory, Vol. 50, No. 7, pp. 1524–1535, July 2004.
[49] D.-W. Yue and E.-H. Yang, “Asymptotically Gaussian weight distribution and per- formance of multi-dimensional Turbo block codes and product codes,” IEEE Trans.Communications, Vol. 52, No.5, pp. 728–736, May 2004.
[50] A. Kaltchenko and E.-H. Yang, “Universal compression of ergodic quantum sources,”
Quantum Information and Computation, Vol.3, No.4, pp. 359–375, July, 2003.
[51] Y. Jia and E.-H. Yang, “Context-dependent multilevel pattern matching for lossless image compression,” IEEE Trans. Inform. Theory, Vol. 49, No. 12, pp. 3169–3184, December 2003.
[52] E.-H. Yang and Da-ke He, “Efficient universal lossless compression algorithms based on a greedy sequential grammar transform–Part two: With context models,” IEEE Trans. Inform. Theory, Vol. 49, No. 11, pp. 2874–2894, November 2003.
[53] E.-H. Yang and D.-K. He, “Huffman coding,” The Wiley Encyclopedia of Telecommu- nications, 2002.
[54] J. C. Kieffer and E.-H. Yang, “Structured grammar-based codes for universal lossless data compression,” Communicationsin Information and Systems, Vol. 2, No. 1, pp. 29-52, June 2002 (InvitedPaper).
[55] E.-H. Yang and Z. Zhang, “The redundancy of source coding with a fi y criterion– Part II: Coding at a fi rate level with unknown statistics,” IEEE Trans. Inform.Theory, Vol.IT-47, No. 1, pp. 126–145, January 2001.
[56] E.-H. Yang, A. Kaltchenko, and J. 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.
[57] Q. Liu, E.-H. Yang, and Z. Zhang, “Throughput analysis of CDMA systems using multiuser receivers”, IEEE Transactions on Communications, Vol. 49, No. 7, pp. 1192–1202, July 2001.
[58] E.-H. Yang and Y. 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.
[59] J. C. Kieffer, E.-H. Yang, G. Nelson, and P. Cosman, “Universal lossless compression via multilevel pattern matching,” IEEE Trans. Inform. Theory, Vol.IT-46, No. 4, pp. 1227–1245, July 2000.
[60] J. C. Kieffer and E.-H. 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.
[61] E.-H. Yang and J. C. Kieffer, “Efficient universal lossless compression algorithms based on a greedy sequential grammar transform–Part one: Without context models,” IEEETrans.Inform. Theory, Vol.IT-46, No. 3, pp. 755–777, May 2000.
[62] B. Zhu, E.-H. Yang, and A. 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.
[63] E.-H. Yang and Z. 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.
[64] E.-H. Yang and Z. Zhang, “On the redundancy of lossy source coding with abstract alphabets,” IEEE Trans. Inform. Theory, Vol. IT-45, No. 4, pp. 1092–1110, May 1999. [65] E.-H. Yang and Z. Zhang, “Variable rate trellis source encoding,” IEEE Trans. Inform.Theory, Vol. IT-45, No. 2, pp. 586–608, March 1999.
[66] E.-H. Yang and Z. 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.
[67] E.-H. Yang and J. 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.
[68] E.-H. Yang, Z. Zhang, and T. Berger, “Fixed slope universal lossy data compression,”
IEEE Trans. Inform. Theory, Vol. IT-43, No. 5, pp. 1465–1476, Sept. 1997.
[69] E.-H. Yang and J. C. Kieffer, “On the redundancy of the fi database Lempel-Ziv algorithm for φ-mixing sources,” IEEE Trans. Inform. Theory, Vol. IT-43, No. 4, pp. 1101–1111, July 1997.
[70] W.-S. Chen, E.-H. Yang, and Z. 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.
[71] John C. Kieffer and E.-H. Yang, “Ergodic behavior of graph entropy,” ERA Amer. Math. Society, Vol. 3, No. 1, pp. 11-16, 1997.
[72] R. Ahlswede, E.-H. Yang, and Z. Zhang, “Identification via compressed data,” IEEETrans.Inform. Theory, Vol. IT-43, No.1, pp. 48–70, Jan. 1997.
[73] Z. Zhang, E.-H. Yang, and V. K. Wei, “The redundancy of source coding with a fi y criterion–Part I: Known statistics,” IEEE Trans. Inform. Theory, Vol. IT-43, No.1, pp. 71–91, Jan. 1997.
[74] Z. Zhang and E.-H. 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.
[75] E.-H. Yang and J. 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.
[76] J. 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.
[77] En-hui Yang and Shi-yi Shen, “Distortion program-size complexity with respect to a fi y criterion and rate distortion function,” IEEE Trans. Inform. Theory, Vol. IT-39, No. 1, pp. 288–292, 1993.
[78] En-hui Yang, “Limit theorems for Chaitin complexity,” Chinese Science Bulletin, Vol.No. 21, 1992.
[79] En-hui Yang, “Universal almost sure data compression for abstract alphabets and arbitrary fi y criterions,” Problemsof Control and Information theory, Vol.20(6), pp. 397–408, 1991.
[80] En-hui Yang and Shi-yi Shen, “Chaitin complexity, Shannon information content of a single event, and infi random sequences—Part one,”, Sciencein China Series A, Vol. 34, No.10, pp. 1183–1193, 1991.
[81] En-hui Yang and Shi-yi Shen, “Chaitin complexity, Shannon information content of a single event, and infi te random sequences—part two,” Sciencein China Series A , Vol. 34, No. 11, pp.1307–1319, 1991.
[82] En-hui Yang, “The proof of Levin’s conjecture,” Chinese Science Bulletin, Vol. 34, No.21, pp.1761–1765, Nov. 1989.