<h1>Feng, Hanying</h1>
<h2>Combined from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2>
<ul>
<li>Feng, Hanying and Effros, Michelle (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110615-075056151">Near Optimality of Composite Multiple Description Source Codes</a>; IEEE Transactions on Information Theory; Vol. 57; No. 6; 3783-3795; <a href="https://doi.org/10.1109/TIT.2011.2132890">10.1109/TIT.2011.2132890</a></li>
<li>Feng, Hanying and Effros, Michelle (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FENisit05">On the rate loss and construction of source codes for broadcast channels</a>; ISBN 0-7803-9151-9; International Symposium on Information Theory (ISIT 2005), Adelaide, South Australia, Australia, 4-9 September 2005; 82-86; <a href="https://doi.org/10.1109/ISIT.2005.1523297">10.1109/ISIT.2005.1523297</a></li>
<li>Feng, Hanying and Effros, Michelle (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FENieeetit05">On the rate loss of multiple description source codes</a>; IEEE Transactions on Information Theory; Vol. 51; No. 2; 671-683; <a href="https://doi.org/10.1109/TIT.2004.840900">10.1109/TIT.2004.840900</a></li>
<li>Zhao, Qian and Feng, Hanying, el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:ZHAdcc04">Multiresolution source coding using entropy constrained dithered scalar quantization</a>; ISBN 0769520820; Data Compression Conference (DCC '04), Snowbird, UT, 23-25 March 2004; 22-31; <a href="https://doi.org/10.1109/DCC.2004.1281447">10.1109/DCC.2004.1281447</a></li>
<li>Effros, Michelle and Feng, Hanying, el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit04b">Suboptimality of the Karhunen-Loève transform for transform coding</a>; IEEE Transactions on Information Theory; Vol. 50; No. 8; 1605-1619; <a href="https://doi.org/10.1109/TIT.2004.831787">10.1109/TIT.2004.831787</a></li>
<li>Feng, Hanying and Effros, Michelle (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FENisit02">On the rate loss of multiple description source codes and additive successive refinement codes</a>; ISBN 0-7803-7501-7; IEEE International Symposium on Information Theory (ISIT '02), Lausanne, Switzerland, 30 June-5 July 2002; 94; <a href="https://doi.org/10.1109/ISIT.2002.1023366">10.1109/ISIT.2002.1023366</a></li>
<li>Feng, Hanying and Effros, Michelle (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FENisit03">On the achievable region for multiple description source codes on Gaussian sources</a>; ISBN 0-7803-7728-1; IEEE International Symposium on Information Theory (ISIT '03), Yokohama, Japan, 29 June-4 July, 2003; 195; <a href="https://doi.org/10.1109/ISIT.2003.1228209">10.1109/ISIT.2003.1228209</a></li>
<li>Feng, Hanying and Zhao, Qian, el al. (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FENdcc03">Network source coding using entropy constrained dithered quantization</a>; ISBN 0-7695-1896-6; Data Compression Conference (DCC '03), Snowbird, UT, 25-27 March 2003; 427; <a href="https://doi.org/10.1109/DCC.2003.1194046">10.1109/DCC.2003.1194046</a></li>
<li>Effros, Michelle and Feng, Hanying, el al. (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFdcc03">Suboptimality of the Karhunen-Loève transform for transform coding</a>; ISBN 0-7695-1896-6; DCC 2003, Data Compression Conference, Snowbird, UT, 23-25 March 2003; 293-302; <a href="https://doi.org/10.1109/DCC.2003.1194020">10.1109/DCC.2003.1194020</a></li>
<li>Feng, Hanying and Effros, Michelle (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FENieeetit03">Improved bounds for the rate loss of multiresolution source codes</a>; IEEE Transactions on Information Theory; Vol. 49; No. 4; 809-821; <a href="https://doi.org/10.1109/TIT.2003.809604">10.1109/TIT.2003.809604</a></li>
<li>Feng, Hanying and Effros, Michelle (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FENieeetip02">On the rate-distortion performance and computational efficiency of the Karhunen-Loeve transform for lossy data compression</a>; IEEE Transactions on Image Processing; Vol. 11; No. 2; 113-122; <a href="https://doi.org/10.1109/83.982819">10.1109/83.982819</a></li>
<li>Feng, Hanying and Effros, Michelle (2001) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FENisit01">Improved bounds for the rate loss of multi-resolution source codes</a>; ISBN 0-7803-7123-2; IEEE International Symposium on Information Theory (ISIT '01), Washington, DC, 24-29 June 2001; 193; <a href="https://doi.org/10.1109/ISIT.2001.936056">10.1109/ISIT.2001.936056</a></li>
<li>Feng, Hanying and Effros, Michelle (2000) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FENisit00">Multi-resolution channel codes</a>; ISBN 0-7803-5857-0; IEEE International Symposium on Information Theory (ISIT '00), Sorrento, Italy, 25-30 June 2000; 487; <a href="https://doi.org/10.1109/ISIT.2000.866785">10.1109/ISIT.2000.866785</a></li>
<li>Feng, Hanying and Effros, Michelle (1999) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FENicassp99">Separable Karhunen Loeve transforms for the weighted universal transform coding algorithm</a>; ISBN 0-7803-5041-3; IEEE International Conference on Acoustics, Speech, and Signal (ICASSP '99), Phoenix, AZ, 15-19 March 1999; 2435-2438; <a href="https://doi.org/10.1109/ICASSP.1999.760622">10.1109/ICASSP.1999.760622</a></li>
</ul>