<h1>Effros, Michelle</h1>
<h2>Article from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2>
<ul>
<li>Yavas, Recep Can and Kostina, Victoria, el al. (2023) <a href="https://authors.library.caltech.edu/records/d2gvc-3yj77">Variable-Length Sparse Feedback Codes for Point-to-Point, Multiple Access, and Random Access Channels</a>; IEEE Transactions on Information Theory; <a href="https://doi.org/10.1109/tit.2023.3338632">10.1109/tit.2023.3338632</a></li>
<li>Yavas, Recep Can and Kostina, Victoria, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20211122-171053652">Gaussian Multiple and Random Access Channels: Finite-Blocklength Analysis</a>; IEEE Transactions on Information Theory; Vol. 67; No. 11; 6983-7009; <a href="https://doi.org/10.1109/tit.2021.3111676">10.1109/tit.2021.3111676</a></li>
<li>Noorzad, Parham and Langberg, Michael, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210729-170824093">Negligible Cooperation: Contrasting the Maximaland Average-Error Cases</a>; IEEE Transactions on Information Theory; Vol. 67; No. 9; 5885-5902; <a href="https://doi.org/10.1109/tit.2021.3093891">10.1109/tit.2021.3093891</a></li>
<li>Noorzad, Parham and Effros, Michelle, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210825-143502652">The Birthday Problem and Zero-Error List Codes</a>; IEEE Transactions on Information Theory; Vol. 67; No. 9; 5791-5803; <a href="https://doi.org/10.1109/tit.2021.3100806">10.1109/tit.2021.3100806</a></li>
<li>Yavas, Recep Can and Kostina, Victoria, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210113-163504947">Random Access Channel Coding in the Finite Blocklength Regime</a>; IEEE Transactions on Information Theory; Vol. 67; No. 4; 2115-2140; <a href="https://doi.org/10.1109/tit.2020.3047630">10.1109/tit.2020.3047630</a></li>
<li>Chen, Shuqing and Effros, Michelle, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200723-131543186">Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access Scenarios</a>; IEEE Transactions on Information Theory; Vol. 66; No. 11; 6688-6722; <a href="https://doi.org/10.1109/tit.2020.3005155">10.1109/tit.2020.3005155</a></li>
<li>Langberg, Michael and Effros, Michelle (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191031-124927142">The Edge-Removal Problem's Connections to the Zero-Error and δ-Dependence Problems in Network Coding</a>; IEEE Transactions on Information Theory; Vol. 66; No. 2; 900-913; <a href="https://doi.org/10.1109/tit.2019.2949803">10.1109/tit.2019.2949803</a></li>
<li>Noorzad, Parham and Effros, Michelle, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170614-160818881">Can Negligible Rate Increase Network Reliability?</a>; IEEE Transactions on Information Theory; Vol. 64; No. 6; 4282-4293; <a href="https://doi.org/10.1109/TIT.2017.2713801">10.1109/TIT.2017.2713801</a></li>
<li>Noorzad, Parham and Effros, Michelle, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180104-165541678">The Unbounded Benefit of Encoder Cooperation for the k-user MAC</a>; IEEE Transactions on Information Theory; Vol. 64; No. 5; 3655-3678; <a href="https://doi.org/10.1109/TIT.2017.2777965">10.1109/TIT.2017.2777965</a></li>
<li>Effros, Michelle and Poor, H. Vincent (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170911-153412853">Claude Shannon: His Work and Its Legacy</a>; EMS Newsletter; Vol. 2017; 29-34; <a href="https://doi.org/10.4171/NEWS/103/5">10.4171/NEWS/103/5</a></li>
<li>Effros, Michelle and El Rouayheb, Salim, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150324-094743353">An Equivalence between Network Coding and Index Coding</a>; IEEE Transactions on Information Theory; Vol. 61; No. 5; 2478-2487; <a href="https://doi.org/10.1109/TIT.2015.2414926">10.1109/TIT.2015.2414926</a></li>
<li>Jalali, Shirin and Effros, Michelle (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150420-095344158">Separation of Source-Network Coding and Channel Coding in Wireline Networks</a>; IEEE Transactions on Information Theory; Vol. 61; No. 4; 1524-1538; <a href="https://doi.org/10.1109/TIT.2015.2397932">10.1109/TIT.2015.2397932</a></li>
<li>Koetter, Ralf and Effros, Michelle, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20141016-103239168">A Theory of Network Equivalence - Part II: Multiterminal Channels</a>; IEEE Transactions on Information Theory; Vol. 60; No. 7; 3709-3732; <a href="https://doi.org/10.1109/TIT.2014.2319075">10.1109/TIT.2014.2319075</a></li>
<li>Dikaliotis, Theodoros K. and Dimakis, Alexandros G., el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140529-100215879">On the Delay Advantage of Coding in Packet Erasure Networks</a>; IEEE Transactions on Information Theory; Vol. 60; No. 5; 2868-2883; <a href="https://doi.org/10.1109/TIT.2014.2306817">10.1109/TIT.2014.2306817</a></li>
<li>Marden, Jason R. and Effros, Michelle (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120502-135624623">The Price of Selfishness in Network Coding</a>; IEEE Transactions on Information Theory; Vol. 58; No. 4; 2349-2361; <a href="https://doi.org/10.1109/TIT.2011.2177576">10.1109/TIT.2011.2177576</a></li>
<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>Goldsmith, Andrea and Effros, Michelle, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110601-090031771">Beyond Shannon: the quest for fundamental performance limits of wireless ad hoc networks</a>; IEEE Communications Magazine; Vol. 49; No. 5; 195-205; <a href="https://doi.org/10.1109/MCOM.2011.5762818">10.1109/MCOM.2011.5762818</a></li>
<li>Kim, Sukwon and Ho, Tracey, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110316-153639993">Network Error Correction With Unequal Link Capacities</a>; IEEE Transactions on Information Theory; Vol. 57; No. 2; 1144-1164; <a href="https://doi.org/10.1109/TIT.2010.2095090">10.1109/TIT.2010.2095090</a></li>
<li>Dikaliotis, Theodoros K. and Ho, Tracey, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110314-145005157">Multiple-Access Network Information-Flow and Correction Codes</a>; IEEE Transactions on Information Theory; Vol. 57; No. 2; 1067-1079; <a href="https://doi.org/10.1109/TIT.2010.2095130">10.1109/TIT.2010.2095130</a></li>
<li>Koetter, Ralf and Effros, Michelle, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110322-093250669">A Theory of Network Equivalence-
Part I: Point-to-Point Channels</a>; IEEE Transactions on Information Theory; Vol. 57; No. 2; 972-995; <a href="https://doi.org/10.1109/TIT.2010.2102110">10.1109/TIT.2010.2102110</a></li>
<li>Doshi, Vishal and Shah, Devavrat, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20101011-105632282">Functional Compression Through Graph Coloring</a>; IEEE Transactions on Information Theory; Vol. 56; No. 8; 3901-3917; <a href="https://doi.org/10.1109/TIT.2010.2050835">10.1109/TIT.2010.2050835</a></li>
<li>Effros, Michelle and Goldsmith, Andrea, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100709-094818847">Generalizing Capacity: New Definitions and Capacity Theorems for Composite Channels</a>; IEEE Transactions on Information Theory; Vol. 56; No. 7; 3069-3087; <a href="https://doi.org/10.1109/TIT.2010.2048456">10.1109/TIT.2010.2048456</a></li>
<li>Effros, Michelle and Goldsmith, Andrea, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100615-104959080">The rise of instant wireless networks</a>; Scientific American; Vol. 302; No. 4; 72-77</li>
<li>Marco, Daniel and Effros, Michelle (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20090821-135659881">On Lossless Coding With Coded Side Information</a>; IEEE Transactions on Information Theory; Vol. 55; No. 7; 3284-3296; <a href="https://doi.org/10.1109/TIT.2009.2021309">10.1109/TIT.2009.2021309</a></li>
<li>Jaggi, Sidharth and Langberg, Michael, el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:JAGieeetit08">Resilient Network Coding in the Presence of Byzantine Adversaries</a>; IEEE Transactions on Information Theory; Vol. 54; No. 6; 2596-2603; <a href="https://doi.org/10.1109/TIT.2008.921711">10.1109/TIT.2008.921711</a></li>
<li>Ho, Tracey and Leong, Ben, el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:HOTieeetit08">Byzantine Modification Detection in Multicast Networks With Random Network Coding</a>; IEEE Transactions on Information Theory; Vol. 54; No. 6; 2798-2803; <a href="https://doi.org/10.1109/TIT.2008.921894">10.1109/TIT.2008.921894</a></li>
<li>Muresan, Dan and Effros, Michelle (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:MURieeetit08">Quantization as Histogram Segmentation: Optimal Scalar Quantizer Design in Network Systems</a>; IEEE Transactions on Information Theory; Vol. 54; No. 1; 344-366; <a href="https://doi.org/10.1109/TIT.2007.911170">10.1109/TIT.2007.911170</a></li>
<li>Gowaikar, Radhika and Dana, Amir F., el al. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:GOWieeetc07">A Practical Scheme for Wireless Network Operation</a>; IEEE Transactions on Communications; Vol. 55; No. 3; 463-476; <a href="https://doi.org/10.1109/TCOMM.2007.892448">10.1109/TCOMM.2007.892448</a></li>
<li>Ho, Tracey and Médard, Muriel, el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:HOTieeetit06">A Random Linear Network Coding Approach to Multicast</a>; IEEE Transactions on Information Theory; Vol. 52; No. 10; 4413-4430; <a href="https://doi.org/10.1109/TIT.2006.881746">10.1109/TIT.2006.881746</a></li>
<li>Coleman, Todd P. and Lee, Anna H., el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:COLieeetit06">Low-Complexity Approaches to Slepian–Wolf Near-Lossless Distributed Data Compression</a>; IEEE Transactions on Information Theory; Vol. 52; No. 8; 3546-3561; <a href="https://doi.org/10.1109/TIT.2006.878215">10.1109/TIT.2006.878215</a></li>
<li>Ramamoorthy, Aditya and Jain, Kamal, el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:RAMieeetit06">Separating distributed source coding from network coding</a>; IEEE Transactions on Information Theory; Vol. 52; No. 6; 2785-2795; <a href="https://doi.org/10.1109/TIT.2006.874534">10.1109/TIT.2006.874534</a></li>
<li>Fleming, Michael and Effros, Michelle (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FLEieeetit06">On rate-distortion with mixed types of side information</a>; IEEE Transactions on Information Theory; Vol. 52; No. 4; 1698-1705; <a href="https://doi.org/10.1109/TIT.2006.871059">10.1109/TIT.2006.871059</a></li>
<li>Dana, Amir F. and Gowaikar, Radhika, el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:DANieeetit06a">Capacity of wireless erasure networks</a>; IEEE Transactions on Information Theory; Vol. 52; No. 3; 789-804; <a href="https://doi.org/10.1109/TIT.2005.864424">10.1109/TIT.2005.864424</a></li>
<li>Jaggi, Sidharth and Sanders, Peter, el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:JAGieeetit05">Polynomial time algorithms for multicast network code construction</a>; IEEE Transactions on Information Theory; Vol. 51; No. 6; 1973-1982; <a href="https://doi.org/10.1109/TIT.2005.847712">10.1109/TIT.2005.847712</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 Dugatkin, Diego (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit04a">Multiresolution vector quantization</a>; IEEE Transactions on Information Theory; Vol. 50; No. 12; 3130-3145; <a href="https://doi.org/10.1109/TIT.2004.838381">10.1109/TIT.2004.838381</a></li>
<li>Fleming, Michael and Zhao, Qian, el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FLEieeetit02">Network vector quantization</a>; IEEE Transactions on Information Theory; Vol. 50; No. 8; 1584-1604; <a href="https://doi.org/10.1109/TIT.2004.831832">10.1109/TIT.2004.831832</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>Zhao, Qian and Effros, Michelle (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:ZHAieeetit03">Lossless and near-lossless source coding for multiple access networks</a>; IEEE Transactions on Information Theory; Vol. 49; No. 1; 112-128; <a href="https://doi.org/10.1109/TIT.2002.806145">10.1109/TIT.2002.806145</a></li>
<li>Effros, Michelle and Visweswariah, Karthik, el al. (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit02">Universal lossless source coding with the Burrows Wheeler transform</a>; IEEE Transactions on Information Theory; Vol. 48; No. 5; 1061-1081; <a href="https://doi.org/10.1109/18.995542">10.1109/18.995542</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>Effros, Michelle (2001) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit01">Universal multiresolution source codes</a>; IEEE Transactions on Information Theory; Vol. 47; No. 6; 2113-2129; <a href="https://doi.org/10.1109/18.945238">10.1109/18.945238</a></li>
<li>Goldsmith, Andrea J. and Effros, Michelle (2001) <a href="https://resolver.caltech.edu/CaltechAUTHORS:GOLieeetit01">The capacity region of broadcast channels with intersymbol interference and colored Gaussian noise</a>; IEEE Transactions on Information Theory; Vol. 47; No. 1; 219-240; <a href="https://doi.org/10.1109/18.904524">10.1109/18.904524</a></li>
<li>Effros, Michelle (2000) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFprocieee00">PPM performance with BWT complexity: a fast and effective data compression algorithm</a>; Proceedings of the IEEE; Vol. 88; No. 11; 1703-1712; <a href="https://doi.org/10.1109/5.892706">10.1109/5.892706</a></li>
<li>Effros, Michelle and Chou, Philip A., el al. (1999) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetip99">Weighted universal image compression</a>; IEEE Transactions on Image Processing; Vol. 8; No. 10; 1317-1329; <a href="https://doi.org/10.1109/83.791958">10.1109/83.791958</a></li>
<li>Effros, Michelle (1999) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit99">Distortion-rate bounds for fixed- and variable-rate multiresolution source codes</a>; IEEE Transactions on Information Theory; Vol. 45; No. 6; 1887-1910; <a href="https://doi.org/10.1109/18.782109">10.1109/18.782109</a></li>
<li>Effros, Michelle (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFieeespm98">Optimal modeling for complex system design</a>; IEEE Signal Processing Magazine; Vol. 15; No. 6; 51-73; <a href="https://doi.org/10.1109/79.733496">10.1109/79.733496</a></li>
<li>Goldsmith, Andrea J. and Effros, Michelle (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:GOLieeetc98">Joint design of fixed-rate source codes and multiresolution channel codes</a>; IEEE Transactions on Communications; Vol. 46; No. 10; 1301-1312; <a href="https://doi.org/10.1109/26.725308">10.1109/26.725308</a></li>
<li>Chou, Philip A. and Effros, Michelle, el al. (1996) <a href="https://resolver.caltech.edu/CaltechAUTHORS:CHOieeetit96">A vector quantization approach to universal noiseless coding and quantization</a>; IEEE Transactions on Information Theory; Vol. 42; No. 4; 1109-1138; <a href="https://doi.org/10.1109/18.508836">10.1109/18.508836</a></li>
<li>Effros, M. and Chou, P. A., el al. (1994) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit94b">Variable-rate source coding theorems for stationary nonergodic sources</a>; IEEE Transactions on Information Theory; Vol. 40; No. 6; 1920-1925; <a href="https://doi.org/10.1109/18.340466">10.1109/18.340466</a></li>
<li>Effros, Michelle and Chou, Philip A., el al. (1994) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit94a">A Progressive Universal Noiseless Coder</a>; IEEE Transactions on Information Theory; Vol. 40; No. 1; 108-117; <a href="https://doi.org/10.1109/18.272460">10.1109/18.272460</a></li>
</ul>