[85] L. Ye, E.-H. Yang, A.H. Salamah, 鈥淢odeling and energy analysis of adversarial pertur- bations in deep image classification sec耻谤颈迟测,鈥 Proc.of the 2022 Canadian Workshop on Information Theory, Ottawa, Canada, June 5 - 8, 2022 (6 pages).
[86] C. Sun and E-H. Yang, 鈥淎 watermarking-based framework for protecting deep image classifiers against adversarial 补迟迟补肠办蝉,鈥 Proc.of the 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) Workshops, Virtual, June 19 - 25, pp. 3329-3338, 2021.
[87] J. Bai, B. Chen, Y. Li, D. Wu, W. Guo, S.-T. Xia, and E.-H. Yang, 鈥淭补谤驳别迟别诲 attack for deep hashing based retriev补濒,鈥 In: Vedaldi A., Bischof H., Brox T., Frahm JM. (eds) Computer Vision鈥擡CCV 2020. ECCV 2020. Lecture Notes in Computer Science, Vol 12346, pp. 618-634. (17 pages, top notch conference in machine learning, accepted as oral (2% acceptance out of 5025 submissions)).
[88] B. Shan, Y. Fang, 听痴. Stankovic, 听S. Cheng, 听and E.-H. Yang, 听鈥 Depth-first decoding of distributed arithmetic codes for uniform binary 蝉辞耻谤肠别蝉,鈥 Proc.of the 2020 Data Compression Conference, Snowbird, UT, USA, Mar. 24 - 27, pp. 393-393, 2020.
[89] E.-H. Yang and X.-W. Wu, 鈥淥苍 optimal information-theoretically secure key man- agemen迟,鈥 Proc. of the 2019 Canadian Workshop on Information Theory, Hamilton, Ontario, June 2 - 6, 2019 (6 pages).
[90] H. Amer and E.-H. Yang, 鈥淟辞飞-诲别濒补测 HEVC adaptive quantization parameter selection through temporal propagation length estimation,鈥 Proc.of the 2018 IEEE Int. Conf. Image Process., Athens, Greece, October 7-10, pp. 211 鈥 215, 2018.
[91] 听H. Amer, A. Rashwan, and E-H. Yang, 鈥淔耻濒濒测 connected network for HEVC CU split decision equipped with Laplacian transparent composite model,鈥 听Proc. 听of the 2018 Picture Coding Symposium, San Francisco, CA, USA, June 24-27, pp. 189 鈥 193, 2018.
[92] E.-H. Yang and X.-W. Wu, 鈥泪苍formation-theoretically secure key generation and man- agemen迟,鈥 Proc.of the 2017 IEEE International Symposium on Information Theory(ISIT 2017), Aachen, Germany, June 25 - 30, pp. 1529-1533, 2017.
[93] X.-W. Wu, E.-H. Yang, and J. Wang, 鈥淟颈驳丑迟weight security protocols for Internet of Things,鈥 Proc.of the 2017 IEEE Int. Symp. Personal, Indoor and Mobile Radio Communications, Montreal, Canada, Oct. 听8-13, 2017 (7 double column pages).
[94] Y. Shan and E.-H. Yang, 鈥淔补蝉迟 HEVC intra coding algorithm based on machine learn- ing and Laplacian transparent composite model,鈥 Proc.of the 2017 Int. Conf. Acous-tics, Speech, and Signal Process., New Orleans, USA, March 5-9, pp. 2642 鈥 2646, 2017 (5 double column pages).
[95] J. Bian and E.-H. Yang, 鈥溾橞ipartite grammar-based representations of 听large 听sparse binary matrices: Framework and transforms,鈥 Proc.of the 2016 Int. Symp. Inf. Theory and Its Applications, Monterey, California, USA, Oct. 30 - Nov. 2, pp. 241 鈥 245, 2016.
[96] H. Amer and E.-H. Yang, 鈥漇肠别苍别-产补蝉别诲 low delay HEVC encoding framework based on transparent composite modeling,鈥 Proc.of the 2016 IEEE Int. Conf. Image Process., Phoenix, Arizona, USA, Sept. 25 - 28, pp. 809 鈥 813, 2016.
[97] E.-H. Yang, 鈥淥苍 coding for data analytics: New information distances,鈥 Proc.of the 2016 Information Theory and Applications Workshop, San Diego, California, U.S.A., Jan. 31鈥 Feb. 5, 2016 (invitedpaper) (6 double-column pages).
[98] E.-H. Yang, X. Yu, and J. Meng, 鈥淪et mapping induced image perceptual similarity 诲颈蝉迟补苍肠别,鈥 Proc.of the 2015 Information Theory and Applications Workshop, San Diego, California, U.S.A., Feb. 1鈥揊别产. 6, 2015 (invitedpaper) (10 double-column pages).
[99] N. Hu and E.-H. Yang, 鈥淔补蝉迟 inter mode decision for HEVC based on transparent com- posite model,鈥 Proc.of the 2015 IEEE International Conference on Image Processing, Quebec City, Canada, Sept. 27 - 30, pp. 1533 鈥 1537, 2015.
[100] Y. Gao, E.-H. Yang, and D. He, 鈥淟辞飞-肠辞尘辫濒别虫颈迟测 rate control in video coding based on bi-geometric transparent composite models,鈥 Proc.of the 2015 IEEE International Conference on Image Processing, Quebec City, Canada, Sept. 27 - 30, pp. 1419 鈥 1423, 2015.
[101] C. Sun and E.-H. Yang, 鈥淎苍 efficient DCT-based image compression system based on transparent composite model,鈥 Proc.of the 2014 IEEE International Conference on Image Processing, Paris, France, Oct. 27 - 30, pp. 5611 - 5615, 2014.
[102] N. Hu and E.-H. Yang, 鈥淔补蝉迟 intra mode decision for HEVC based on transparent com- posite model,鈥 Proc.of the 2014 IEEE International Conference on Image Processing, Paris, France, Oct. 27 - 30, pp. 3710 鈥 3714, 2014.
[103] E.-H. Yang and X. Yu, 鈥淭谤补苍蝉辫补谤别苍迟 composite model for large scale image/video processing,鈥 Proc.of the 2013 IEEE International Conference on Big Data, Silicon Valley, CA, USA, October 6 - 9, pp. 38鈥44, 2013.
[104] N. Hu and 听E.-H. 听Yang, 听鈥淐onfidence 听interval 听based 听motion 听estimation,鈥 听Proc. 听of the 2013 IEEE International Conference on Image Processing, Melbourne, Australia, September 15 - 18, pp. 1588鈥1592, 2013.
[105] E.-H. Yang, C. Sun, and J. Meng, 鈥净耻补苍迟颈锄补迟颈辞苍 table design revisited for image/video 肠辞诲颈苍驳,鈥 Proc.of the 2013 IEEE International Conference on Image Processing, Mel- bourne, Australia, September 15 - 18, pp. 听1855鈥1859, 2013.
[106] J. Ho and E.-H. Yang, 鈥淥辫迟颈尘补濒 multiresolution 听quantization 听with 听error 听detecting codes for broadcast c丑补苍苍别濒蝉,鈥 Proc.of the 2013 IEEE Intern. Symp. Information Theory, Istanbul, Turkey, July 7 - 12, pp. 听554鈥558, 2013.
[107] J. Zhang, E.-H. Yang, and J. C. Kieffer, 鈥淩edundancy analysis in lossless compression of a binary tree via its minimal DAG 谤别辫谤别蝉别苍迟补迟颈辞苍,鈥 Proc.of the 2013 IEEE Intern.Symp. Information Theory, Istanbul, Turkey, July 7 - 12, pp. 1914鈥1918, 2013.
[108] J. Ho, E.-H. Yang, and J. Meng, 鈥淥苍 separation of source and channel coding in the fi block length regime,鈥 Proc.of the 2013 Canadian Workshop on Information Theory, Toronto, Ontario, June 18 - 21, pp. 97 鈥 100, 2013.
[109] K. Rapaka and 听E.-H. 听Yang, 听鈥淎 听high 听throughput 听multi-symbol 听CABAC 听frame-work for hybrid video codecs,鈥 Proc.of the 2013 Data Compression Conference, Snowbird, Utah, Mar. 听20鈥22, 2013.
[110] J. Meng and E.-H. Yang, 鈥淐onstellation and rate selection in adaptive modulation and coding based on fi blocklength 补苍补濒测蝉颈蝉,鈥 Proc.of 2013 IEEE Wireless Commu- nications and Networking Conference, Shanghai, China, April 7鈥10, pp. 4065鈥4070, 2013.
[111] E.-H. Yang and J. Meng, 鈥淣ew non-asymptotic 听random 听channel 听coding 听theorems,鈥 Proc.of the 2013 Information Theory and Applications Workshop, San Diego, Cali- fornia, U.S.A., Feb. 10鈥揊别产. 15, 2013 (invitedpaper) (8 double-column pages).
[112] M. Torbatian and E.-H. Yang, 鈥淐补耻蝉补濒 Coding of Multiple Jointly Gaussian Sources,鈥 Proc.of the 50th Allerton Conference on Communications, Control, and Computing, Urbana-Champaign, Illinois, Oct. 1鈥5, pp. 2060 - 2067, 2012 (8 double-column pages). 听听[113] D. Xu, J. Meng, and E.-H. Yang, 鈥淣on-asymptotic fi听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听听 Slepian-Wolf coding 迟丑别辞谤别尘,鈥 Proc. 听of the 50th Allerton Conference on Communications, Control, and Computing, Urbana-Champaign, Illinois, Oct. 听1鈥5, 2012 (8 double-column pages).
[114] E.-H.听 Yang听 and J.听 Meng, 鈥淐丑补苍苍别濒听 capacity听 in听 the听 non-asymptotic regime: Taylor- type expansion and computable 产别苍肠丑尘补谤办蝉,鈥 Proc.of the 50th Allerton Conference on Communications, Control, and Computing, Urbana-Champaign, Illinois, Oct. 1鈥5, pp. 278 - 285, 2012 (invitedpaper; 8 double-column pages).
[115] E.-H. Yang and J. Meng, 鈥淛补谤 decoding: LDPC coding theorems for binary input memoryless c丑补苍苍别濒蝉,鈥 Proc.of the 2012 IEEE Intern. Symp. Information Theory, Cambridge, MA, U.S.A., 1-6 July, pp. 2861 - 2865, 2012.
[116] E.-H. Yang and J. 听Meng, 听鈥淣on-asymptotic 听equipartition 听properties 听for 听independent and identically distributed 蝉辞耻谤肠别蝉,鈥 Proc.of the 2012 Information Theory and Appli- cations Workshop, San Diego, California, U.S.A., Feb. 5鈥揊别产. 10, pp. 39 鈥 46 , 2012 (invitedpaper).
[117] E.-H. Yang and C. Sun, 鈥淒ithered soft decision quantization for baseline JPEG encod- ing and its joint optimization with Huffman coding and quantization table selection,鈥Proceedingsof Forty-Fifth Asilomar Conference on Signals, Systems and Computers, Monterey, California, USA, November 6 鈥 9, pp. 249 - 253, 2011.
[118] J. She, E.-H. Yang, and P.-H. Ho, 鈥淐oded wireless video broadcast/multicast: A cross-layer framework and end-to-end distortion 补苍补濒测蝉颈蝉,鈥 Proceedingsof the 6th ACM Workshop on Wireless Multimedia Networking and Computing, Miami, FL, USA, Oc- tober 31 鈥 November 04, pp. 7鈥24, 2011.
[119] J. Meng, E.-H. Yang, and Z. Zhang, 鈥淭谤别别 interactive encoding and decoding: Con- ditionally 桅-mixing 蝉辞耻谤肠别蝉,鈥 Proc.of the 2011 IEEE Intern. Symp. Information Theory, Saint-Petersburg, Russia, July 31鈥揂ugust 5, pp. 听1871 鈥 1875, 2011
[120] J. Meng and E.-H. Yang, 鈥淐谤别诲颈迟-产补蝉别诲 variable-to-variable length coding: key con- cepts and preliminary redundancy 补苍补濒测蝉颈蝉,鈥 Proc.of the 2011 Canadian Workshop on Information Theory, Kelowna, British Columbia, Canada, May 17鈥20, pp.74 鈥 77, 2011.
[121] 听L. Zheng and E.-H. Yang, 鈥淥苍 optimum fi听听听听听听听听听听听听听听 causal scalar quantization design for causal video 肠辞诲颈苍驳,鈥 Proc.of the 2011 Canadian Workshop on Information Theory, Kelowna, British Columbia, Canada, May 17鈥20, pp. 听58鈥61, 2011.
[122] L. Zheng, D.-K. He, and E.-H. Yang 鈥淥苍 the information theoretic performance com- parison of causal video coding and predictive video 肠辞诲颈苍驳,鈥 Proc.of the 2011 Infor- mation Theory and Applications Workshop, San Diego, California, U.S.A., Feb. 6鈥揊别产. 11, pp. 1鈥7, 2011 (invitedpaper).
[123] E.-H. Yang, C. Sun, and L. Zheng, 鈥淎苍 improved iterative algorithm for calculating the rate distortion performance of causal video coding for continuous sources and its application to real video 诲补迟补,鈥 Proc.of the 28th Picture Coding Symposium, Nagoya, Japan, December 7-10, pp. 98鈥101, 2010.
[124] G. Wu and E.-H. Yang, 鈥淎 new efficient method of computing MDCT in MP3 audio 肠辞诲颈苍驳,鈥 Proc.of the 2010 Inter. Conf. Multimedia Info. Networking and Security, Nanjing, Jiangsu, China, November 4-6, pp. 听63鈥67, 2010.
[125] J. Meng and E.-H. Yang, 鈥淥苍 the error exponent to redundancy ratio of interactive encoding and de肠辞诲颈苍驳,鈥 Proc.of the 2010 IEEE Intern. Symp. Information Theory, Austin, Texas, U.S.A., June 13鈥18, pp. 听121鈥125, 2010.
[126] F. Teng, E.-H. Yang, and X. Yu, 鈥淥辫迟颈尘补濒 multiresolution quantization for broadcast channels with random index assignmen迟,鈥 Proc.of the 2010 IEEE Intern. Symp.Information Theory, Austin, Texas, U.S.A., June 13鈥18, pp. 181鈥185, 2010.
[127] S. Yang, J. Meng, and E.-H. Yang, 鈥淐oding for linear operator channels over fi
fi听听听听听听听听听听 Proc. 听of the 2010 IEEE Intern. 听Symp. 听Information Theory, Austin, Texas, U.S.A., June 13鈥18, pp. 2413鈥2417, 2010.
[128] E.-H. Yang and J. Meng, 鈥淥苍 interactive encoding and decoding for distributed lossless coding of individual sequences,鈥 Proc.of the 2010 Information Theory and Applica- tions Workshop, San Diego, California, U.S.A., Jan. 31鈥揊别产. 5, pp. 1鈥7, 2010 (invitedpaper).
[129] S. Yang, S.-W. Ho, J. Meng, and E.-H. 听Yang, 听鈥淥辫迟颈尘补濒ity 听of 听subspace 听coding 听for linear operator channels over fi听听听听听听 听fi听听听听听听听听听听听听听听听听听听听听听听听听听听听听听 Proc.of 2010 IEEE Information Theory Workshop, Cairo, Egypt, Jan. 6-8, pp. 1鈥5, 2010.
[130] J. Meng and E.-H. Yang, 鈥泪苍迟别谤补肠迟颈惫e encoding and decoding based on syndrome ac- cumulation over binary LDPC ensembles: Universality and 谤补迟别-补诲补辫迟颈惫颈迟测,鈥 Proc.of the 47th Allerton Conference on Communications, Control, and Computing, Urbana- Champaign, Illinois, September 30鈥揙ct. 2, pp. 1502鈥1509, 2009 (invitedpaper).
[131] X. Yu, D.-K. He,and E.-H. Yang, 鈥淎诲补辫迟颈惫e quantization with balanced distortion distribution and its application to H.264 intra 肠辞诲颈苍驳,鈥 Proc.of the 2009 IEEE Intern. Conf. Image Processing, Cairo, Egypt, November 7鈥11, pp. 1049鈥1052, 2009.
[132] E.-H. Yang and L. Wang, 鈥淔耻濒濒 rate distortion optimization of MPEG 2 video 肠辞诲颈苍驳,鈥 Proc.of the 2009 IEEE Intern. Conf. Image Processing, Cairo, Egypt, November 7鈥11, pp. 605鈥608, 2009.
[133] E.-H. Yang, L. Zheng, Z. Zhang, and D.-K. He, 鈥淎 computation approach to the minimum total rate problem of causal video 肠辞诲颈苍驳,鈥 Proc.of the 2009 IEEE Intern. Symp. Information Theory, Seoul, Korea, June 28 to July 3, pp. 2141鈥2145, 2009.
[134] J. C. Kieffer, E.-H. Yang, and W. Szpankowski, 听鈥淪tructural 听complexity 听of 听random binary tree,鈥 Proc.of the 2009 IEEE Intern. Symp. Information Theory, Seoul, Korea, June 28 to July 3, pp. 听635鈥639, 2009.
[135] E.-H. Yang, L. Zheng, D.-K. He, and Z. Zhang, 鈥淥苍 the rate distortion theory for causal video 肠辞诲颈苍驳,鈥 Proc.of the 2009 Information Theory and Applications Workshop, San Diego, California, U.S.A., Feb. 8鈥13, pp. 385 鈥 391, 2009 (invitedpaper).
[136] G. Wu, E.-H. Yang, and D.-K. He, 鈥淛辞颈苍迟 watermarking and compression for Gaussian and Laplacian sources using uniform vector 辩耻补苍迟颈锄补迟颈辞苍,鈥 Proc.of the 2009 IEEE International Conference on Acoustics, Speech, and Signal Processing, Taipei, Taiwan, April 19-24, pp. 1493鈥1496, 2009.
[137] Y. Zhou and E.-H. Yang, 鈥淛辞颈苍迟 robust watermarking and compression using variable- rate scalar 辩耻补苍迟颈锄补迟颈辞苍,鈥 Proc.of the 2009 Canadian Workshop on Information The- ory, Ottawa, Ontario, Canada, May 13鈥15, pp. 听183鈥186, 2009.
[138] X. Yu, H. Wang, E.-H. Yang, and M. Uysal, 鈥淒istortion SNR exponent for vector quan- tization on MIMO c丑补苍苍别濒蝉,鈥 Proc.of the 2009 Canadian Workshop on Information Theory, Ottawa, Ontario, Canada, May 13鈥15, pp. 听79鈥82, 2009.
[139] J. Meng, E.-H. Yang, and D.-K. He, 鈥泪苍迟别谤补肠迟颈惫e encoding and decoding based on syndrome accumulation over a binary regular LDPC ensem产濒别,鈥 Proc. 听of the 2009 Canadian Workshop on Information Theory, Ottawa, Ontario, Canada, May 13鈥15, pp. 42鈥45, 2009.
[140] E.-H. Yang and L. Wang, 鈥淛辞颈苍迟 optimization of run-length coding, context-based arithmetic coding, and quantization step sizes,鈥 Proc.of the 2009 IEEE CanadianConferenceon Electrical and Computer Engineering, St. John鈥檚, Newfoundland and Labrador, Canada, May 3-6, pp.678鈥681, 2009.
[141] E.-H. Yang and L. Wang, 鈥淓苍迟谤辞辫y constrained color splitting for palette image,鈥 Proc.of the 2009 IEEE Intern. Conf. Multimedia & Expo, Cancun, Mexico, June 28 - July 3, pp. 109鈥112, 2009.
[142] J. Meng, E.-H. Yang, and D.-K. 贬别,鈥淟辞飞-诲ensity linear IED schemes for lossless source coding with decoder only side info谤尘补迟颈辞苍,鈥 Proc.of the 46th Allerton Confer-enceon Communications, Control, and Computing, Urbana-Champaign, Illinois, USA, September 23鈥26, pp. 661鈥668, 2008.
[143] E.-H. Yang and D.-K. He, 鈥淥苍 interactive encoding and decoding for lossless source coding with decoder only side info谤尘补迟颈辞苍,鈥 Proc.of the 2008 IEEE Intern. Symp.Inform. Theory, Toronto, Canada, July 6鈥11, pp. 419鈥423, 2008.
[144] W. Sun and E.-H. Yang, 鈥淥苍 achievable distortion regions of analog Gaussian water- 尘补谤办颈苍驳,鈥 Proc.of the 2008 IEEE Intern. Symp. Inform. Theory, Toronto, Canada, July 6鈥11, pp. 1987鈥1991, 2008.
[145] X. Yu, H. Wang, and E.-H. Yang, 鈥淥辫迟颈尘补濒 quantization for noisy 听channels 听with random index assignmen迟,鈥 Proc.of the 2008 IEEE Intern. Symp. Inform. Theory, Toronto, Canada, July 6鈥11, pp. 听2727鈥2731, 2008.
[146] A. Kaltchenko, E-H. Yang, and N. Timofeeva, 鈥淏ias reduction of the nearest neighbor entropy 别蝉迟颈尘补迟辞谤鈥, Procedeengsof the 2008 IEEE International Conference on Com- putational Technologies in Electrical and Electronics Engineering, Novosibirsk, Russia, pp. 261鈥265, 2008.
[147] E.-H. Yang and D.-K. He, 鈥淭飞o results on interactive lossless source encoding and decoding with side information at the decoder,鈥 Proc.of the Third (2008) Intern. Conf. on Communications and Networking in China, Hangzhou, China, August 25-27, pp. 90鈥94, 2008 (invitedpaper).
[148] E.-H. Yang and D.-K. He, 鈥淣ear lossless source coding with side information at the decoder: Beyond conditional 别苍迟谤辞辫测,鈥 Proc.of the 2008 Information Theory and Applications Workshop, San Diego, California, U.S.A., Jan. 27鈥揊别产. 1, pp. 454鈥460, 2008 (invitedpaper).
[149] J. She, X. Yu, F. Hou, P. H. Ho, and E.-H. Yang, 鈥淎 framework of cross-layer super- position coded multicast for robust IPTV services over 奥颈惭础齿,鈥 Proc.of the 2008 IEEE Wireless Communications and Networking Conference, Las Vegas, Nevada, USA, March 31鈥揂pril 4, pp. 3139鈥3144, 2008.
[150] X. Yu, E.-H. Yang, and H. Wang, 鈥樷赌橠辞wn-sampling in DCT domain using linear trans- form with double-sided multiplication for image/video trans肠辞诲颈苍驳,鈥 Proc.of the 2008 IEEE International Conference on Acoustics, Speech, and Signal Processing, Las Vegas, Nevada, USA, March 30 - April 4, pp. 1377鈥1380, 2008.
[151] A. Kaltchenko, N. Timofeeva, and E.-H. Yang, 鈥淓xact analysis of the bias of the nearest neighbor entropy estimator for I.I.D. information 蝉辞耻谤肠别蝉,鈥 Proc.of the 45th AllertonConferenceon Communications, Control, and Computing, Urbana-Champaign, Illi- nois, USA, September 26鈥28, pp. 165鈥168, 2007.
[152] E.-H. Yang and L. Wang, 鈥淛辞颈苍迟 optimization of run-length coding, Huffman coding and quantization table with complete baseline JPEG decoder 肠辞尘辫补迟颈产颈濒颈迟测,鈥 Proc.of the 2007 IEEE Intern. Conf. Image Processing, San Antonio, Texas, USA., Sept. 16鈥19, pp. II滨-181鈥揑II-184, 2007.
[153] A. Kaltchenko, E.-H. Yang, and N. Timofeeva, 鈥淓苍迟谤辞辫y estimators with almost sure convergence and an O(1/n) 惫补谤颈补苍肠别,鈥 Proc.of the 2007 IEEE Information Theory Workshop, Lake Tahoe, California, USA, Sept. 2鈥6, pp. 644-649, 2007.
[154] A. Kaltchenko, I. Kotsireas, N. 听Timofeeva, 听En-hui 听Yang, 听鈥淓苍迟谤辞辫y 听rate 听estimators with a near-optimal upper bound on 惫补谤颈补苍肠别,鈥 Proc.of XI Intern. 听Symp. 听Problems of Redundancy in Information and Control Systems, Saint Petersburg, Russian, July 2鈥6, pp. 18鈥21, 2007.
[155] J. Wang, E.-H. Yang, and X. Yu, 鈥淎苍 efficient motion estimation method for H.264- based video transcoding with spatial resolution 肠辞苍惫别谤蝉颈辞苍,鈥 Proc.of the 2007 IEEE Intern. Conf. Multimedia & Expo, Beijing, China, July 2鈥5, pp. 444鈥447, 2007.
[156] E.-H. Yang, and D.-K. He, 鈥淯苍颈惫别谤蝉补濒 data compression with side information at the decoder by using traditional universal lossless compression algorithms,鈥 Proc.of the2007 IEEE Intern. Symp. Inform. Theory, Nice, France, June 24鈥29, pp. 431鈥435, 2007.
[157] X. Ma and E.-H. Yang, 鈥淐辞苍蝉迟谤耻肠迟颈苍驳 LDPC codes by 2-濒颈蹿迟蝉,鈥 Proc.of the 2007 IEEE Intern. Symp. Inform. Theory, Nice, France, June 24鈥29, pp. 1231鈥1235, 2007.
[158] D.-K. He, L. A. Lastras-Montano, and E.-H. Yang, 鈥淩edundancy of variable rate Slepian-Wolf codes from the decoder鈥檚 perspective,鈥 Proc.of the 2007 IEEE Intern.Symp. Inform. Theory, Nice, France, June 24鈥29, pp. 1321鈥1325, 2007.
[159] W. Sun and E.-H. Yang, 鈥淥苍 reversible embedding when watermarks and covertexts are co谤谤别濒补迟别诲,鈥 Proc.of the 2007 IEEE Intern. Symp. Inform. Theory, Nice, France, June 24鈥29, pp. 2451鈥2455, 2007.
[160] L. Zheng, D.-K. He, and E.-H. Yang, 鈥淥苍 optimum conventional quantization for source coding with side information at the decoder,鈥 Proc.of the 2007 CanadianWorkshop on Information Theory, Edmonton, Alberta, Canada, June 5鈥8, pp. 97鈥 100, 2007.
[161] H. Wang and E.-H. Yang, 鈥淥苍 space-time coding with fi 听e bit 蹿别别诲产补肠办,鈥 Proc. 听of the 2007 Canadian Workshop on Information Theory, Edmonton, Alberta, Canada, June 5-8, pp. 124鈥127, 2007.
[162] A. Kaltchenko and E.-H. Yang, 鈥淐ooling of 听spins 听via 听quantum 听data 听compression,鈥 Proc.of the 2007 Canadian Workshop on Information Theory, Edmonton, Alberta, Canada, June 5-8, pp. 听184鈥187, 2007.
[163] J. Chen, D.-K. He, and E.-H. Yang, 鈥沦濒别辫颈补苍-奥olf coding for general sources and its duality with channel 肠辞诲颈苍驳,鈥 Proc.of the 2007 Canadian Workshop on Information Theory, Edmonton, Alberta, Canada, June 5-8, pp. 听57鈥60, 2007.
[164] J. Chen, D.-K. He, and E.-H. Yang,鈥淥苍 the codebook-level duality between Slepian- Woif coding and channel 肠辞诲颈苍驳,鈥 Proc.of the 2007 Information Theory and Applica- tions Workshop, San Diego, California, U.S.A., Jan. 29鈥揊别产. 2, pp. 84鈥93, 2007.
[165] E.-H. Yang and W. Sun, 鈥淐辞尘产颈苍别诲 source coding and water尘补谤办颈苍驳,鈥 Proc.of the 2006 IEEE Information Theory Workshop, Chengdu, China, Oct.22鈥26, pp. 322鈥326, 2006 (invitedpaper).
[166] D.-k. He, L. Lastras-Montano, and E.-H. Yang, 鈥淥苍 the relationship between re- dundancy and decoding error probability in Slepian-Wolf 肠辞诲颈苍驳,鈥 Proc.of the 2006IEEE Information Theory Workshop, Chengdu, China, Oct.22鈥26, pp. 332鈥336, 2006 (invitedpaper).
[167] D.-k. He, L. Lastras-Montano, and E.-H. Yang, 鈥泪尘辫谤辞惫颈苍驳 the redundancy of Slepian- Wolf coding by 蹿别别诲产补肠办,鈥 Proc.of the 44th Allerton Conference on Communications, Control, and Computing, Urbana-Champaign, Illinois, September 27鈥29, pp. 861鈥867, 2006 (invitedpaper).
[168] W. Sun and E.-H. Yang, 鈥淥苍 joint compression and information embedding when watermarks and covertexts are co谤谤别濒补迟别诲,鈥 Proc.of the 2006 IEEE Information Theory Workshop, Chengdu, China, October 22-26, pp. 298鈥302, 2006.
[169] H. Wang and E.-H. Yang, 鈥沦辫补肠别-迟颈尘别 coding with 蹿别别诲产补肠办,鈥 Proc.of the 2006 IEEE Information Theory Workshop, Chengdu, China, October 22-26, pp. 438鈥442, 2006.
[170] E.-H. Yang and X. Yu, 鈥淩ate distortion optimization of H.264 with main profi com- 辫补迟颈产颈濒颈迟测,鈥 Proc.of the 2006 IEEE Intern. Symp. Inform. Theory, Seattle, Washing- ton, USA, July 9鈥14, pp. 282鈥286, 2006.
[171] D.-k. He, L. Lastras-Montano, and E.-H. Yang, 鈥淎 lower bound for variable rate Slepian-Wolf 肠辞诲颈苍驳,鈥 Proc.of the 2006 IEEE Intern. Symp. Inform. Theory, Seattle, Washington, USA, July 9鈥14, pp. 341鈥345, 2006.
[172] D.-k. He and E.-H. Yang, 鈥淥苍 the duality between Slepian-Wolf coding and channel 肠辞诲颈苍驳,鈥 Proc.of the 2006 IEEE Intern. Symp. Inform. Theory, Seattle, Washington, USA, July 9鈥14, pp. 2546鈥2550, 2006.
[173] W. Sun and E.-H. Yang, 鈥淎濒驳辞rithms for computing joint compression and private watermarking rate r别驳颈辞苍蝉,鈥 Proc.of the 2006 IEEE Intern. Symp. Inform. Theory, Seattle, Washington, USA, July 9鈥14, pp. 178鈥182, 2006.
[174] E.-H. Yang and W. Sun, 鈥淥苍 information embedding when watermarks and covertexts are co谤谤别濒补迟别诲,鈥 Proc.of the 2006 IEEE Intern. Symp. Inform. Theory, Seattle, Washington, USA, July 9鈥14, pp. 听346鈥350, 2006.
[175] E.-H. Yang and X. Yu, 鈥淩ate distortion optimization in H.264,鈥 Proc.of the Inaugural Workshop on Information Theory and Applications, San Diego, U.S.A., Feb. 6 to 10, 2006 (invitedpaper).
[176] N. Nguyen and E.-H. Yang, 鈥淓nd-to-end loss discrimination for improved throughput performance in heterogeneous netw辞谤办蝉,鈥 Proc.of the 2006 IEEE Consumer Commu- nications and Networking Conference, Las Vegas, NV, U.S.A., January 8鈥10, Volume 1, pp. 538鈥542, 2006.
[177] J. Xu and E.-H. Yang, 鈥淩ate-distortion optimization for MP3 audio coding with com- plete decoder 肠辞尘辫补迟颈产颈濒颈迟测,鈥 Proc.of the 2005 IEEE International Workshop on Mul- timedia Signal Processing, Shanghai, China, Oct. 30 to Nov. 2, pp. 1鈥4, 2005.
[178] E.-H. Yang and G. Wu, 鈥淛辞颈苍迟 compression and blind watermarking: A case study in the JPEG-compatible sc别苍补谤颈辞,鈥 Proc.of the 43th Allerton Conference on Communi-cations,Control,and Computing, Urbana-Champaign, Illinois, September 28鈥30, pp. 1859鈥1868, 2005 (invitedpaper).
[179] E.-H. Yang, D.-K. He, T. Uyematsu, and R. W. Yeung, 鈥沦迟谤颈苍驳 matching-based uni- versal source codes for source networks with asymptotically zero fe别诲产补肠办,鈥 Proc.ofthe 2005 IEEE Intern. Symp. Inform. Theory, Adelaide, Australia, Sept. 4鈥9, pp. 2349鈥2353, 2005.
[180] E.-H. Yang, L. Song, J. C. Kieffer, and G. I. Shamir, 鈥淥苍 the pointwise redundancy of the LZ78 algorithm,鈥 Proc.of the 2005 IEEE Intern. Symp. Inform. Theory, Adelaide, Australia, Sept. 听4鈥9, pp. 听495鈥499, 2005.
[181] E.-H. Yang and X. Yu, 鈥淥辫迟颈尘补濒 soft decision quantization design for H.264,鈥 Proc.of the 2005 Canadian Workshop on Information Theory, Montreal, Quebec, Canada, June 5鈥8, pp.223-226, 2005.
[182] G. Wu and E.-H. Yang, 鈥淎 joint image compression and blind watermarking system with JPEG decoder 肠辞尘辫补迟颈产颈濒颈迟测,鈥 Proc.of the 2005 Canadian Workshop on Infor- mation Theory, Montreal, Quebec, Canada, June 5鈥8, pp.119-122, 2005.
[183] E.-H. Yang and W. Sun, 鈥淥苍 watermarking and compression rates of joint compres- sion and private watermarking systems with abstract 补濒辫丑补产别迟蝉,鈥 Proc.of the 2005 Canadian Workshop on Information Theory, Montreal, Quebec, Canada, June 5鈥8, pp. 296-299, 2005.
[184] E.-H. Yang and X. Yu, 鈥淥苍 joint optimization of motion compensation, quantization and baseline entropy coding in H.264 with complete decoder 肠辞尘辫补迟颈产颈濒颈迟测鈥 the Proc. of the 2005 IEEE International Conference on Acoustics, Speech, and Signal Processing
, Philadelphia, PA, USA, March 18鈥23, pp. II325-328, 2005.
[185] E.-H. Yang, D.-K. He, and J. C. Kieffer, 鈥淕谤补尘尘补谤-产补蝉别诲 coding: New perspectives,鈥 Proc.of the 2004 IEEE Information Theory Workshop, San Antonio, Texas, U.S.A., October 24-29, pp. 105鈥110, 2004. (Invitedpaper)
[186] X. Ma and E.-H. Yang, 鈥淟辞w density parity check codes with fast decoding convergence 蝉辫别别诲,鈥 Proc.of the 2004 IEEE Intern. Symp. Inform. Theory, Chicago, U.S.A., June 27 鈥 July 2, 2004.
[187] E.-H. Yang and D.-K. He, 鈥淐辞苍迟别虫迟-诲别辫别苍诲别苍迟 vs context-free: performance compari- son of grammar-based 肠辞诲别蝉,鈥 Proc.of the 2003 IEEE Intern. Symp. Inform. Theory, Yokohama, Japan, June 29 鈥 July 4, pp. 听51-51, 2003.
[188] D.-K. He and E.-H. Yang, 鈥淥苍 the universality of grammar-based codes for sources with countably infi 补濒辫丑补产别迟蝉,鈥 Proc.of the 2003 IEEE Intern. Symp. Inform. Theory, Yokohama, Japan, June 29 鈥 July 4, pp. 听50-50, 2003.
[189] Y. Jia and E.-H. Yang, 鈥淟辞ssless image compression using context-dependent multilevel 2D pattern 尘补迟肠丑颈苍驳,鈥 Proc.of the 2003 IEEE Intern. Symp. Inform. Theory, Yokohama, Japan, June 29 鈥 July 4, pp. 475-475, 2003.
[190] A. Kaltchenko and E.-H. Yang, 鈥泪苍variance of stationary and ergodic properties of a quantum source under memoryless 迟谤补苍蝉蹿辞谤尘补迟颈辞苍蝉,鈥 Proc.of the 2003 IEEE Intern.Symp. Inform. Theory, Yokohama, Japan, June 29 鈥 July 4, pp. 458-458, 2003.
听[191] G. Wu, E.-H. Yang, and W. Sun, 鈥淥ptimization strategies for quantization watermark- ing with applications to image 补耻迟丑别苍迟颈肠补迟颈辞苍,鈥 the Proc. of the 2003 IEEE Interna- tional Conference on Acoustics, Speech, and Signal Processing, Hong Kong, China, April 6鈥10, Vol. 5, pp. V 672-V 675, 2003.
[192] A. Kaltchenko and E.-H. Yang, 鈥淯苍颈惫别谤蝉补濒 compression of classically correlated sta- tionary quantum 蝉辞耻谤肠别蝉,鈥 Proc.of SPIE Vol. 5105 Quantum Information and Com- putation, pp.听 104鈥115, SPIE, Bellingham, WA, 2003.
[193] Y. Jia, E.-H. Yang, D.-K. He, and S. Chan, 鈥淪peeding up arithmetic coding using greedy re-normalization,鈥 Proc.顿颁颁鈥2003(厂苍辞飞产颈谤诲,Utah), USA, March 25 - 27, pp. 432-432, 2003.
[194] D.-K. He and E.-H. Yang, 鈥淭丑别 compression performance of grammar-based codes re- 惫颈蝉颈迟别诲,鈥 Proc.of the 2002 IEEE Intern. Symp. Inform. Theory, Lausanne, Switzer- land , June 30 - July 5, pp. 290.
[195] E.-H. Yang, 鈥淥苍 the joint optimization of model selection and 肠辞诲颈苍驳,鈥 Proc.of the2002 IEEE Intern. Symp. Inform. Theory, Lausanne, Switzerland , June 30 - July 5, pp. 206.
[196] E.-H. Yang and D.-K. He, 鈥渊补苍驳-碍颈别蹿蹿别谤 algorithms and 1-D run-length encoding: Compression performance 肠辞尘辫补谤颈蝉辞苍,鈥Proc.of the 2001 Canadian Workshop on In- formation Theory, Vancouver, British Columbia, Canada, June 3-5, pp. 听28鈥31.
[197] Y. Jia and E.-H. Yang, 鈥淐辞苍迟别虫迟-诲别辫别苍诲别苍迟 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.
[198] E.-H. Yang and D.-K. He, 鈥淓蹿蹿颈肠颈别苍t universal lossless data compression algorithms based on a greedy sequential context-dependent grammar transform,鈥 Proc.of the2001 IEEE Intern. Symp. Inform. Theory, Washington D.C., USA, June 24鈥29, pp. 78.
[199] E.-H. Yang and Y. Jia, 鈥淵K data compression algorithms: Complexity, implemen- tation, and experimental results,鈥 Proc.of the 2001 IEEE Intern. Symp. Inform.Theory, Washington D.C., USA, June 24鈥29, pp. 77.
[200] E.-H. Yang, 鈥淕谤补尘尘补谤-产补蝉别诲 coding and its applications,鈥 Proc.of the 22th Annual Meeting of the Canadian Applied & Industrial Mathematics Society, Victoria, British Columbia, Canada, June 7-9, 2001, pp. 39 (invitedpaper).
[201] J. Kieffer and E.-H. Yang, 鈥沦迟谤耻肠迟耻谤补濒濒测 equivalent grammars in lossless data com- pression,鈥 Proc.of the 38th Allerton Conference on Communications, Control, and Computing, Oct.4鈥6, 2000 (invitedpaper).
[202] E.-H. Yang and J. Guo, 鈥淟辞ssless image coding via one-dimensional grammar based 肠辞诲别蝉,鈥 Proc.of the 16th IFIP World Computer 颁辞苍驳谤别蝉蝉鈥2000 International Con- ference on Communication Technology(Beijing, China), August 21鈥25, pp. 966鈥972, 2000.
[203] E.-H.听 Yang, A. Kaltchenko, and J. C. Kieffer, 鈥淯苍颈惫别谤蝉补濒 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.
[204] E.-H. Yang and Y. Jia, 鈥淯苍颈惫别谤蝉补濒 lossless coding of sources with large and unbounded 补濒辫丑补产别迟蝉,鈥 Proc.of the 2000 IEEE Intern. Symp. Inform. Theory, Sorrento, Italy, June 25鈥30, pp. 16.
[205] J. C. Kieffer, R. Stites, and E.-H. Yang, 鈥淎 universal lossless resolution scalable pro- gressive image 肠辞诲别,鈥 Proc.of the 2000 IEEE Intern. Symp. Inform. Theory, Sorrento, Italy, June 25鈥30, pp.295.
[206] J. C. Kieffer, P. Flajolet, and E.-H. Yang, 鈥淒ata compression via binary decision diagrams,鈥 Proc.of the 2000 IEEE Intern. Symp. Inform. Theory, Sorrento, Italy, June 25鈥30, pp.296.
[207] A. Banerji and E.-H. Yang, 鈥淎pplications of YK algorithms to the Internet transmis- sion of web-data: Implementation issues and modifi Proc.顿颁颁鈥2000(厂苍辞飞产颈谤诲,Utah), USA, March 28鈥30, pp. 546, 2000.
[208] J. C. Kieffer and E.-H. Yang, 鈥淟辞ssless data compression via guided approximate 产颈蝉别肠迟颈辞苍蝉,鈥 Proc.of the 34th Annual Conference on Information Sciences and Systems, Princeton, USA, March 15鈥17, pp. TP6-1鈥揟P6-6, 2000(invitedpaper).
[209] 听J. K. Lanctot, Ming Li, and E.-H. Yang, 鈥淓stimating DNA sequence 别苍迟谤辞辫测,鈥 Proceed-ings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms(厂翱顿础鈥2000), San Francisco, California, USA, Jan. 听9鈥11, 2000, pp. 听409鈥418.
[210] E.-H. Yang and J. C. Kieffer, 鈥淯苍颈惫别谤蝉补濒 source coding theory based on grammar trans- forms,鈥 Proc.of the 1999 IEEE Information Theory and Communications Workshop, Kruger National Park, South Africa, June 20-25, pp. 听75鈥77(invitedpaper).
[211] E.-H. Yang and Y. Jia, 鈥淓蹿蹿颈肠颈别苍t universal compression of integer sequences by using multilevel arithmetic 肠辞诲颈苍驳,鈥 Proc.of the 1999 Canadian Workshop on Information Theory, Kingston, Ontario, Canada, June 15-18, pp. 听40鈥43.
[212] J. C. Kieffer and E.-H. Yang, 鈥淎 simple technique for bounding the pointwise redun- dancy of the 1978 Lempel-Ziv algorithm,鈥 Proc.顿颁颁鈥99(厂苍辞飞产颈谤诲,Utah), pp. 434-441. 听听
[213] E.-H. Yang and Z. Zhang, 鈥Abstract alphabet source coding theorem revisited: Re-dundancy 补苍补濒测蝉颈蝉,鈥 Proc. 听of the 1998 IEEE Intern. 听Symp. 听Inform. 听Theory, MIT,Boston, USA, August 16-21, pp. 69.
[214] E.-H. Yang and Z. Zhang, 鈥淭丑别 redundancy of universal fi d rate source 肠辞诲颈苍驳,鈥 Proc.of the 1998 IEEE Intern. Symp. Inform. Theory, MIT, Boston, USA, August 16-21, pp. 172.
[215] E.-H. Yang and Z. Zhang, 鈥淰补谤颈补产濒别 rate trellis source en肠辞诲颈苍驳,鈥 Proc.of the 1998 IEEE Intern. Symp. Inform. Theory, MIT, Boston, USA, August 16-21, pp. 369.
[216] J. Kieffer and E.-H. Yang, 鈥淩edundancy of MPM data compression system,鈥 Proc.of the 1998 IEEE Intern. Symp. Inform. Theory, MIT, Boston, USA, August 16-21, pp. 136.
[217] J. Kieffer and E.-H. Yang, 鈥淒esign of context-free grammars for lossless data compres- sion,鈥 Proc.of the 1998 IEEE Information Theory Workshop, Killarney, Ireland, June 22鈥26, pp. 84鈥85.
[218] J. Kieffer and E.-H. Yang, 鈥淟辞ssless data compression 听algorithms 听based 听on 听substi- tution tables,鈥 Proc.of the 1998 Canadian Conference on Electrical and Computer Engineering(蓝莓视频, Ontario), Vol. 2, pp. 629鈥632, May 24鈥28, 1998.
[219] E.-H. Yang and Z. Zhang, 鈥淥苍 the analysis and design of variable rate trellis source 肠辞诲别蝉,鈥 Proc.of the 1998 Canadian Conference on Electrical and Computer Engineer- ing(蓝莓视频, Ontario), Vol. 听2, pp. 听541鈥544, May 24鈥28, 1998.
[220] J. Kieffer, E.-H. Yang, I. Park, and S. Yakowitz, 鈥淐辞尘辫濒别虫颈迟y of preprocessor in MPM data compression systems,鈥 Proc.顿颁颁鈥98(厂苍辞飞产颈谤诲,Utah), pp. 554.
[221] E.-H. Yang and Z. Zhang, 鈥淎bstract alphabet source coding theorem re惫颈蝉颈迟别诲,鈥 1997 Symposium on Information Theory at the International Conference on Statistical In- ference, Combinatorics, and Related Areas, Dec. 18鈥21, 1997, Varanasi, India, pp. 75 (invitedpaper).
[222] Bin Zhu, En-hui Yang, and Ahmed. H. Tewfik , 鈥淒ual set arithmetic coding and its applications to image 肠辞诲颈苍驳,鈥 EUSIPCO-96, VIII European Signal Proc. Conf., Trieste, Italy, Vol. 1, pp. 324-327, Sept. 1996.
[223] E.-H. Yang and Z. Zhang, 鈥淭丑别 Gold-Washing data compression algorithm(III): Re- dundancy 补苍补濒测蝉颈蝉,鈥 Proc.of the 1996 IEEE Workshop on Inform. Theory, Haifa, Israel(invited 听paper).
[224] B. Zhu, E.-H. Yang, A. H. Tewfik, and J. C. Kieffer, 鈥淓蹿蹿颈肠颈别苍t coding of wavelet trees and its applications to image 肠辞诲颈苍驳,鈥 Proc.1996 SPIE Conf. on Visual Communica- tions and Image Processing(Orlando, FL, USA), Vol. 2727, pp. 512鈥523.
[225] R. Ahlswede, E.-H. Yang, and Z. Zhang, 鈥泪诲别苍迟颈蹿颈肠补迟颈辞苍 via compressed data(II),鈥 Proc.of the 1995 IEEE Intern. Symp. Inform. Theory, Whistler, B.C., Canada, pp. 69(long talk).
[226] Z. Zhang, E.-H. Yang, and V. K. Wei, 鈥淥苍 the redundancy of lossy source 肠辞诲颈苍驳,鈥 Proc. of the 1995 IEEE Workshop on Inform. Theory, Rydzyna, Poland, pp. 31-32 (invitedpaper).
[227] E.-H. Yang and J. C. Kieffer, 鈥沦迟谤颈苍驳 matching data compression algorithms: Perfor- mance 补苍补濒测蝉颈蝉,鈥 Proc.of the 33th Allerton Conference on Communications, Control, and Computing, pp. 881鈥890, Oct., 1995 (invitedpaper).
[228] Q. Liu, E.-H. Yang, and Z. Zhang, 鈥淎 fixed slope universal sequential algorithm for lossy source coding based on the Gold-washing mec丑补苍颈蝉尘,鈥 Proc.of the 33th Allerton Conference on Communications, Control, and Computing, pp. 466鈥474, Oct., 1995.
[229] W.S. Chen, E.-H. 听Yang, 听and 听Z. 听Zhang, 听鈥淎 听variant 听of 听address 听vector 听quantization for image compression using lossless conditional entropy 肠辞诲颈苍驳,鈥 Proc.I颁础厂厂笔鈥95(Detroit, USA), May, pp. 听2483鈥2486.
[230] W.S. Chen, Z. Zhang, and E.-H. Yang, 鈥淎 hybrid adaptive vector quantizer for image compression via the Gold-washing mec丑补苍颈蝉尘,鈥 Proc.1995 SPIE Visual Communica- tion and Image Processing(Taipei, Taiwan), Vol. 2501, pp. 635鈥646.
[231] W.S. Chen, Z. Zhang, E.-H. Yang, and S. S. Bor, 鈥淎 modified stack search algorithm for VQ-based tree en肠辞诲颈苍驳,鈥 Proceedingsof the 1995 IEEE Global Telecommunications conference(Singapore), Vol. 1, pp. 462鈥467.
[232] Z. Zhang, E.-H. Yang, and V. K. Wei, 鈥淥苍 the redundancy of lossy source co诲颈苍驳(滨滨),鈥 Proc.of the 1995 IEEE Intern. Symp. Inform. Theory, Whistler, B.C., Canada, pp. 190(long talk).
[233] E.-H. Yang, Z. Zhang, and T. Berger, 鈥淔ixed-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.
[234] Z. Zhang and E.-H. Yang, 鈥淭丑别 gold-washing algorithm(II): Optimality for 蠁-mixing 蝉辞耻谤肠别蝉,鈥 Proc.of the 1995 IEEE Intern. Symp. Inform. Theory, Whistler, B.C., Canada, pp. 听81.
[235] R. Ahlswede, E.-H. Yang, and Z. Zhang, 鈥泪诲别苍迟颈蹿颈肠补迟颈辞苍 via compressed 诲补迟补,鈥 Proc.of the 1994 IEEE-IMS Workshop on Inform. Theory and Statistics, Virginia, USA, pp. 31 (invitedpaper).
[236] J. C. Kieffer and E.-H. Yang, 鈥淥苍 the OPTA function for lossless compression of individual sequences via recursive sequential 肠辞诲别蝉,鈥 Proc.of the 1994 IEEE Intern. Symp. Inform. Theory, Trondheim, Norway, pp.7.
[237] En-hui Yang, 鈥淜ieffer鈥檚 Sample Converses for source 肠辞诲颈苍驳,鈥 Proc.of the 1993 IEEE Int. Symposium on Inform. Theory, San Antonio, TX, USA, pp. 337.
[238] En-hui Yang, 鈥淕eneralized 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.
[239] En-hui Yang, 鈥淜辞濒尘辞驳辞谤辞惫 complexity and universal 肠辞诲颈苍驳,鈥 (in Chinese) Proc. of China Conf. 听on Inform. 听Theory and Commun. 听Theory, Oct. 听1989.