<h1>Feng, Hanying</h1>
<h2>Article 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: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>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 (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>
</ul>