@article{https://authors.library.caltech.edu/records/d2gvc-3yj77, title = "Variable-Length Sparse Feedback Codes for Point-to-Point, Multiple Access, and Random Access Channels", journal = "IEEE Transactions on Information Theory", url = "https://authors.library.caltech.edu/records/d2gvc-3yj77", id = "record", issn = "0018-9448", doi = "10.1109/tit.2023.3338632" } @other{https://resolver.caltech.edu/CaltechAUTHORS:20221219-234018464, title = "OUTformation: Distributed Data-Gathering with Feedback under Unknown Environment and Communication Delay Constraints", url = "https://resolver.caltech.edu/CaltechAUTHORS:20221219-234018464", id = "record", doi = "10.48550/arXiv.2208.06395" } @other{https://resolver.caltech.edu/CaltechAUTHORS:20220804-201329416, title = "Beyond Capacity: The Joint Time-Rate Region", url = "https://resolver.caltech.edu/CaltechAUTHORS:20220804-201329416", id = "record", doi = "10.48550/arXiv.2101.12236" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20220804-765731000, title = "2022 IEEE International Symposium on Information Theory (ISIT)", chapter = "On the Benefit of Cooperation in Relay Networks", url = "https://resolver.caltech.edu/CaltechAUTHORS:20220804-765731000", id = "record", isbn = "978-1-6654-2159-1", doi = "10.1109/isit50566.2022.9834763" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20220804-765699000, title = "2022 IEEE International Symposium on Information Theory (ISIT)", chapter = "Source Coding with Unreliable Side Information in the Finite Blocklength Regime", url = "https://resolver.caltech.edu/CaltechAUTHORS:20220804-765699000", id = "record", isbn = "978-1-6654-2159-1", doi = "10.1109/isit50566.2022.9834490" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20220804-765685000, title = "2022 IEEE International Symposium on Information Theory (ISIT)", chapter = "Third-order Analysis of Channel Coding in the Moderate Deviations Regime", url = "https://resolver.caltech.edu/CaltechAUTHORS:20220804-765685000", id = "record", isbn = "978-1-6654-2159-1", doi = "10.1109/isit50566.2022.9834841" } @other{https://resolver.caltech.edu/CaltechAUTHORS:20220804-201325308, title = "Network Coding Multicast Key-Capacity", url = "https://resolver.caltech.edu/CaltechAUTHORS:20220804-201325308", id = "record", doi = "10.48550/arXiv.2202.03918" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20211122-171053652, title = "Gaussian Multiple and Random Access Channels: Finite-Blocklength Analysis", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20211122-171053652", id = "record", issn = "0018-9448", doi = "10.1109/tit.2021.3111676", volume = "67" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20220105-510075300, title = "2021 IEEE Information Theory Workshop (ITW)", chapter = "Nested Sparse Feedback Codes for Point-to-Point, Multiple Access, and Random Access Channels", url = "https://resolver.caltech.edu/CaltechAUTHORS:20220105-510075300", id = "record", isbn = "978-1-6654-0312-2", doi = "10.1109/itw48936.2021.9611385" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20210825-143502652, title = "The Birthday Problem and Zero-Error List Codes", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20210825-143502652", id = "record", issn = "0018-9448", doi = "10.1109/tit.2021.3100806", volume = "67" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20210729-170824093, title = "Negligible Cooperation: Contrasting the Maximaland Average-Error Cases", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20210729-170824093", id = "record", issn = "0018-9448", doi = "10.1109/tit.2021.3093891", volume = "67" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20211122-162445616, title = "2021 IEEE International Symposium on Information Theory (ISIT)", chapter = "Every Bit Counts: Second-Order Analysis of Cooperation in the Multiple-Access Channel", url = "https://resolver.caltech.edu/CaltechAUTHORS:20211122-162445616", id = "record", isbn = "978-1-5386-8209-8", doi = "10.1109/isit45174.2021.9517769" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200526-155245665, title = "2021 IEEE International Symposium on Information Theory", chapter = "Edge removal in undirected networks", url = "https://resolver.caltech.edu/CaltechAUTHORS:20200526-155245665", id = "record", isbn = "978-1-5386-8209-8", doi = "10.1109/ISIT45174.2021.9518243" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20211105-214402906, title = "2021 IEEE International Symposium on Information Theory (ISIT)", chapter = "Nested LDPC Codes for Random Access Communication", url = "https://resolver.caltech.edu/CaltechAUTHORS:20211105-214402906", id = "record", isbn = "978-1-5386-8209-8", doi = "10.1109/isit45174.2021.9518171" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20210329-152031630, title = "2021 IEEE International Symposium on Information Theory", chapter = "Variable-length Feedback Codes with Several Decoding Times for the Gaussian Channel", url = "https://resolver.caltech.edu/CaltechAUTHORS:20210329-152031630", id = "record", isbn = "978-1-5386-8209-8", doi = "10.1109/ISIT45174.2021.9517993" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20210113-163504947, title = "Random Access Channel Coding in the Finite Blocklength Regime", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20210113-163504947", id = "record", issn = "0018-9448", doi = "10.1109/tit.2020.3047630", volume = "67" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20200723-131543186, title = "Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access Scenarios", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20200723-131543186", id = "record", issn = "0018-9448", doi = "10.1109/tit.2020.3005155", volume = "66" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200527-072536184, title = "2020 IEEE International Symposium on Information Theory (ISIT)", chapter = "Finite-Blocklength and Error-Exponent Analyses for LDPC Codes in Point-to-Point and Multiple Access Communication", url = "https://resolver.caltech.edu/CaltechAUTHORS:20200527-072536184", id = "record", isbn = "978-1-7281-6432-8", doi = "10.1109/ISIT44484.2020.9173963" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200214-105613893, title = "2020 IEEE International Symposium on Information Theory (ISIT)", chapter = "Gaussian Multiple and Random Access in the Finite Blocklength Regime", url = "https://resolver.caltech.edu/CaltechAUTHORS:20200214-105613893", id = "record", isbn = "978-1-7281-6432-8", doi = "10.1109/ISIT44484.2020.9174026" } @other{https://resolver.caltech.edu/CaltechAUTHORS:20200214-105545016, title = "Towards an Operational Definition of Group Network Codes", url = "https://resolver.caltech.edu/CaltechAUTHORS:20200214-105545016", id = "record", doi = "10.48550/arXiv.2002.00781" } @other{https://resolver.caltech.edu/CaltechAUTHORS:20200214-105541551, title = "Negligible Cooperation: Contrasting the Maximal- and Average-Error Cases", url = "https://resolver.caltech.edu/CaltechAUTHORS:20200214-105541551", id = "record", doi = "10.48550/arXiv.1911.10449" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20191031-124927142, title = "The Edge-Removal Problem's Connections to the Zero-Error and δ-Dependence Problems in Network Coding", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20191031-124927142", id = "record", issn = "0018-9448", doi = "10.1109/tit.2019.2949803", volume = "66" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20191004-100333424, title = "2019 IEEE International Symposium on Information Theory (ISIT)", chapter = "Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys", url = "https://resolver.caltech.edu/CaltechAUTHORS:20191004-100333424", id = "record", isbn = "9781538692912", doi = "10.1109/isit.2019.8849665" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190402-132221601, title = "2019 IEEE International Symposium on Information Theory (ISIT)", chapter = "Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access Scenarios", url = "https://resolver.caltech.edu/CaltechAUTHORS:20190402-132221601", id = "record", isbn = "978-1-5386-9291-2", doi = "10.1109/ISIT.2019.8849742" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20191004-100333246, title = "2019 IEEE International Symposium on Information Theory (ISIT)", chapter = "Universal Privacy Guarantees for Smart Meters", url = "https://resolver.caltech.edu/CaltechAUTHORS:20191004-100333246", id = "record", isbn = "9781538692912", doi = "10.1109/isit.2019.8849679" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20191004-100329963, title = "2019 IEEE International Symposium on Information Theory (ISIT)", chapter = "A Local Perspective on the Edge Removal Problem", url = "https://resolver.caltech.edu/CaltechAUTHORS:20191004-100329963", id = "record", isbn = "9781538692912", doi = "10.1109/isit.2019.8849282" } @other{https://resolver.caltech.edu/CaltechAUTHORS:20190402-145653639, title = "Can Negligible Cooperation Increase Network Capacity? The Average-Error Case", url = "https://resolver.caltech.edu/CaltechAUTHORS:20190402-145653639", id = "record", doi = "10.48550/arXiv.1801.03655" } @other{https://resolver.caltech.edu/CaltechAUTHORS:20190402-145650198, title = "On the Impact of a Single Edge on the Network Coding Capacity", url = "https://resolver.caltech.edu/CaltechAUTHORS:20190402-145650198", id = "record", doi = "10.48550/arXiv.1607.06793" } @other{https://resolver.caltech.edu/CaltechAUTHORS:20190402-145646746, title = "The Multivariate Covering Lemma and its Converse", url = "https://resolver.caltech.edu/CaltechAUTHORS:20190402-145646746", id = "record", doi = "10.48550/arXiv.1508.03349" } @other{https://resolver.caltech.edu/CaltechAUTHORS:20190402-145643163, title = "A Perspective on Future Research Directions in Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20190402-145643163", id = "record", doi = "10.48550/arXiv.1507.05941" } @other{https://resolver.caltech.edu/CaltechAUTHORS:20190402-145635729, title = "Multi-Resolution Video Streaming in Peer-to-peer Networks", url = "https://resolver.caltech.edu/CaltechAUTHORS:20190402-145635729", id = "record", doi = "10.48550/arXiv.1304.1858" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20181126-150049870, title = "2018 IEEE International Symposium on Information Theory (ISIT)", chapter = "Random Access Channel Coding in the Finite Blocklength Regime", url = "https://resolver.caltech.edu/CaltechAUTHORS:20181126-150049870", id = "record", isbn = "978-1-5386-4780-6", doi = "10.1109/ISIT.2018.8437831" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20170614-160818881, title = "Can Negligible Rate Increase Network Reliability?", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170614-160818881", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2017.2713801", volume = "64" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20181126-145651855, title = "2018 IEEE International Symposium on Information Theory (ISIT)", chapter = "Can Negligible Cooperation Increase Capacity? The Average-Error Case", url = "https://resolver.caltech.edu/CaltechAUTHORS:20181126-145651855", id = "record", isbn = "978-1-5386-4780-6", doi = "10.1109/ISIT.2018.8437746" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20180104-165541678, title = "The Unbounded Benefit of Encoder Cooperation for the k-user MAC", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20180104-165541678", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2017.2777965", volume = "64" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170816-163747105, title = "2017 IEEE International Symposium on Information Theory (ISIT)", chapter = "The birthday problem and zero-error list codes", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170816-163747105", id = "record", isbn = "978-1-5090-4096-4", doi = "10.1109/ISIT.2017.8006809" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170816-155534409, title = "2017 IEEE International Symposium on Information Theory (ISIT)", chapter = "The benefit of encoder cooperation in the presence of state information", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170816-155534409", id = "record", isbn = "978-1-5090-4096-4", doi = "10.1109/ISIT.2017.8006486" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170816-151411717, title = "2017 IEEE International Symposium on Information Theory (ISIT)", chapter = "A code equivalence between streaming network coding and streaming index coding", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170816-151411717", id = "record", isbn = "978-1-5090-4096-4", doi = "10.1109/ISIT.2017.8006807" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20170911-153412853, title = "Claude Shannon: His Work and Its Legacy", journal = "EMS Newsletter", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170911-153412853", id = "record", issn = "1027-488X", doi = "10.4171/NEWS/103/5", volume = "2017" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170616-101527136, title = "Globecom Workshops (GC Wkshps), 2016", chapter = "On the Capacity Advantage of a Single Bit", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170616-101527136", id = "record", isbn = "978-1-5090-2482-7", doi = "10.1109/GLOCOMW.2016.7848976" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160824-091111532, title = "2016 IEEE International Symposium on Information Theory (ISIT)", chapter = "Can negligible cooperation increase network reliability?", url = "https://resolver.caltech.edu/CaltechAUTHORS:20160824-091111532", id = "record", isbn = "978-1-5090-1807-9", doi = "10.1109/ISIT.2016.7541606" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160824-105856700, title = "2016 IEEE International Symposium on Information Theory (ISIT)", chapter = "On tightness of an entropic region outer bound for network coding and the edge removal property", url = "https://resolver.caltech.edu/CaltechAUTHORS:20160824-105856700", id = "record", isbn = "978-1-5090-1807-9", doi = "10.1109/ISIT.2016.7541603" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160824-104540804, title = "2016 IEEE International Symposium on Information Theory (ISIT)", chapter = "A characterization of the capacity region for network coding with dependent sources", url = "https://resolver.caltech.edu/CaltechAUTHORS:20160824-104540804", id = "record", isbn = "978-1-5090-1807-9", doi = "10.1109/ISIT.2016.7541602" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160823-153226672, title = "2016 IEEE International Symposium on Information Theory (ISIT)", chapter = "The unbounded benefit of encoder cooperation for the k-user MAC", url = "https://resolver.caltech.edu/CaltechAUTHORS:20160823-153226672", id = "record", isbn = "978-1-5090-1807-9", doi = "10.1109/ISIT.2016.7541317" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160901-145310351, title = "IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)", chapter = "On the Fundamental Limits of Caching in Combination Networks", url = "https://resolver.caltech.edu/CaltechAUTHORS:20160901-145310351", id = "record", isbn = "978-1-4799-1931-4", doi = "10.1109/SPAWC.2015.7227127" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20151006-104241849, title = "2015 IEEE International Symposium on Information Theory", chapter = "On an equivalence of the reduction of k-unicast to 2-unicast capacity and the edge removal property", url = "https://resolver.caltech.edu/CaltechAUTHORS:20151006-104241849", id = "record", isbn = "978-1-4673-7704-1", doi = "10.1109/ISIT.2015.7282479" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20151006-134532103, title = "2015 IEEE International Symposium on Information Theory", chapter = "On the cost and benefit of cooperation", url = "https://resolver.caltech.edu/CaltechAUTHORS:20151006-134532103", id = "record", isbn = "978-1-4673-7704-1", doi = "10.1109/ISIT.2015.7282412" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20150324-094743353, title = "An Equivalence between Network Coding and Index Coding", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20150324-094743353", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2015.2414926", volume = "61" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20150420-095344158, title = "Separation of Source-Network Coding and Channel Coding in Wireline Networks", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20150420-095344158", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2015.2397932", volume = "61" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20150109-094609255, chapter = "Is there a canonical network for network information theory?", url = "https://resolver.caltech.edu/CaltechAUTHORS:20150109-094609255", id = "record", doi = "10.1109/ITW.2014.6970797" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20150203-101915601, title = "2014 52nd Annual Allerton Conference on Communication, Control, and Computing", chapter = "Efficient pooling against strategic adversary with applications in anonymous and reliable networking", url = "https://resolver.caltech.edu/CaltechAUTHORS:20150203-101915601", id = "record", isbn = "978-1-4799-8009-3", doi = "10.1109/ALLERTON.2014.7028608" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20150227-085509466, title = "2014 IEEE International Symposium on Information Theory (ISIT)", chapter = "Linear Capacity Equivalence Between Multiple Multicast and Multiple Unicast", url = "https://resolver.caltech.edu/CaltechAUTHORS:20150227-085509466", id = "record", isbn = "978-1-4799-5186-4", doi = "10.1109/ISIT.2014.6875214" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20141016-103239168, title = "A Theory of Network Equivalence - Part II: Multiterminal Channels", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20141016-103239168", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2014.2319075", volume = "60" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20150227-092238378, title = "2014 IEEE International Symposium on Information Theory (ISIT)", chapter = "On the power of cooperation: Can a little help a lot?", url = "https://resolver.caltech.edu/CaltechAUTHORS:20150227-092238378", id = "record", isbn = "978-1-4799-5186-4", doi = "10.1109/ISIT.2014.6875411" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20140529-100215879, title = "On the Delay Advantage of Coding in Packet Erasure Networks", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140529-100215879", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2014.2306817", volume = "60" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140306-131703841, title = "2013 IEEE Information Theory Workshop (ITW)", chapter = "Outer Bounds and a Functional Study of the Edge Removal Problem", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140306-131703841", id = "record", isbn = "978-1-4799-1321-3", doi = "10.1109/ITW.2013.6691271" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170125-145710627, title = "2013 IEEE Information Theory Workshop (ITW)", chapter = "Zero vs. ε error in interference channels", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170125-145710627", id = "record", isbn = "978-1-4799-1323-7", doi = "10.1109/ITW.2013.6691281" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170125-152255596, title = "2013 IEEE International Symposium on Information Theory", chapter = "An equivalence between network coding and index coding", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170125-152255596", id = "record", isbn = "978-1-4799-0446-4", doi = "10.1109/ISIT.2013.6620370" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170125-162234095, title = "2013 IEEE International Symposium on Information Theory", chapter = "On a capacity equivalence between network and index coding and the edge removal problem", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170125-162234095", id = "record", isbn = "978-1-4799-0446-4", doi = "10.1109/ISIT.2013.6620371" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20130731-073911147, title = "2012 50th Annual Allerton Conference on Communication, Control, and Computing", chapter = "Network Equivalence in the Presence of an Eavesdropper", url = "https://resolver.caltech.edu/CaltechAUTHORS:20130731-073911147", id = "record", isbn = "978-1-4673-4537-8", doi = "10.1109/Allerton.2012.6483322" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170201-165323248, title = "2012 IEEE International Symposium on Information Theory Proceedings", chapter = "On network coding capacity under on-off scheduling", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170201-165323248", id = "record", isbn = "978-1-4673-2579-0", doi = "10.1109/ISIT.2012.6283560" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20120502-135624623, title = "The Price of Selfishness in Network Coding", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20120502-135624623", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2011.2177576", volume = "58" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120618-103335318, title = "2012 IEEE Wireless Communications and Networking Conference (WCNC)", chapter = "On dependence and delay: Capacity bounds for wireless networks", url = "https://resolver.caltech.edu/CaltechAUTHORS:20120618-103335318", id = "record", isbn = "978-1-4673-0436-8", doi = "10.1109/WCNC.2012.6214429" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170307-164206303, title = "49th Annual Allerton Conference on Communication, Control, and Computing", chapter = "Network coding: Is zero error always possible?", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170307-164206303", id = "record", isbn = "978-1-4577-1818-2", doi = "10.1109/Allerton.2011.6120342" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170306-170616021, title = "49th Annual Allerton Conference on Communication, Control, and Computing", chapter = "On sources and networks: Can computational tools derive information theoretic limits?", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170306-170616021", id = "record", isbn = "978-1-4577-1818-2", doi = "10.1109/Allerton.2011.6120302" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120405-094455952, title = "2011 IEEE International Symposium on Information Theory Proceedings", chapter = "On the Equivalence of Shannon Capacity and Stable Capacity in Networks with Memoryless Channels", url = "https://resolver.caltech.edu/CaltechAUTHORS:20120405-094455952", id = "record", isbn = "978-1-4577-0596-0", doi = "10.1109/ISIT.2011.6034178" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120405-085320474, title = "2011 IEEE international symposium on information theory proceedings", chapter = "On Distortion Bounds for Dependent Sources Over Wireless Networks", url = "https://resolver.caltech.edu/CaltechAUTHORS:20120405-085320474", id = "record", isbn = "978-1-4577-0596-0", doi = "10.1109/ISIT.2011.6034171" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120406-092406435, title = "2011 IEEE International Symposium on Information Theory Proceedings", chapter = "On Equivalence for Networks of Noisy Channels under Byzantine Attacks", url = "https://resolver.caltech.edu/CaltechAUTHORS:20120406-092406435", id = "record", isbn = "978-1-4577-0596-0", doi = "10.1109/ISIT.2011.6034284" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20110615-075056151, title = "Near Optimality of Composite Multiple Description Source Codes", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20110615-075056151", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2011.2132890", volume = "57" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20110601-090031771, title = "Beyond Shannon: the quest for fundamental performance limits of wireless ad hoc networks", journal = "IEEE Communications Magazine", url = "https://resolver.caltech.edu/CaltechAUTHORS:20110601-090031771", id = "record", issn = "0163-6804", doi = "10.1109/MCOM.2011.5762818", volume = "49" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20110314-145005157, title = "Multiple-Access Network Information-Flow and Correction Codes", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20110314-145005157", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2010.2095130", volume = "57" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170308-155527646, title = "2011 Information Theory and Applications Workshop", chapter = "On network error correction with limited feedback capacity", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170308-155527646", id = "record", isbn = "978-1-4577-0361-4", doi = "10.1109/ITA.2011.5743579" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20110322-093250669, title = "A Theory of Network Equivalence- Part I: Point-to-Point Channels", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20110322-093250669", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2010.2102110", volume = "57" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20110316-153639993, title = "Network Error Correction With Unequal Link Capacities", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20110316-153639993", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2010.2095090", volume = "57" } @other{https://resolver.caltech.edu/CaltechAUTHORS:20120531-144116913, title = "A Theory of Network Equivalence, Parts I and II", url = "https://resolver.caltech.edu/CaltechAUTHORS:20120531-144116913", id = "record", doi = "10.48550/arXiv.1007.1033" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170315-174808247, title = "48th Annual Allerton Conference on Communication, Control, and Computing", chapter = "Compressive sensing over networks", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170315-174808247", id = "record", isbn = "978-1-4244-8216-0", doi = "10.1109/ALLERTON.2010.5707037" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140529-141715127, title = "2010 IEEE Information Theory Workshop (ITW)", chapter = "On the Delay Advantage of Coding in Packet Erasure Networks", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140529-141715127", id = "record", isbn = "978-1-4244-8262-7", doi = "10.1109/CIG.2010.5592713" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20101011-105632282, title = "Functional Compression Through Graph Coloring", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20101011-105632282", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2010.2050835", volume = "56" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110329-101424835, title = "2010 IEEE International Symposium on Information Theory", chapter = "On the Separation of Lossy Source-Network Coding and Channel Coding in Wireline Networks", url = "https://resolver.caltech.edu/CaltechAUTHORS:20110329-101424835", id = "record", isbn = "978-1-4244-6960-4", doi = "10.1109/ISIT.2010.5513477" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20100709-094818847, title = "Generalizing Capacity: New Definitions and Capacity Theorems for Composite Channels", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20100709-094818847", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2010.2048456", volume = "56" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20100615-104959080, title = "The rise of instant wireless networks", journal = "Scientific American", url = "https://resolver.caltech.edu/CaltechAUTHORS:20100615-104959080", id = "record", issn = "0036-8733", volume = "302" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20100805-081437710, title = "47th Annual Allerton Conference on Communication, Control and Computing", chapter = "Network error correction with unequal link capacities", url = "https://resolver.caltech.edu/CaltechAUTHORS:20100805-081437710", id = "record", isbn = "978-1-4244-5870-7", doi = "10.1109/ALLERTON.2009.5394512" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110329-151508730, title = "2010 IEEE International Symposium on Information Theory", chapter = "Capacity Bounds for Networks of Broadcast Channels", url = "https://resolver.caltech.edu/CaltechAUTHORS:20110329-151508730", id = "record", isbn = "978-1-4244-7891-0", doi = "10.1109/ISIT.2010.5513528" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110331-093006187, title = "2010 IEEE International Symposium on Information Theory Proceedings (ISIT)", chapter = "On Zero-Error Source Coding with Feedback", url = "https://resolver.caltech.edu/CaltechAUTHORS:20110331-093006187", id = "record", isbn = "978-1-4244-7890-3", doi = "10.1109/ISIT.2010.5513304" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110331-091110603, title = "2010 IEEE International Symposium on Information Theory Proceedings (ISIT)", chapter = "Concatenated Polar codes", url = "https://resolver.caltech.edu/CaltechAUTHORS:20110331-091110603", id = "record", isbn = "978-1-4244-7890-3", doi = "10.1109/ISIT.2010.5513508" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170316-135356404, title = "2009 IEEE Information Theory Workshop", chapter = "Linearly representable entropy vectors and their relation to network coding solutions", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170316-135356404", id = "record", isbn = "978-1-4244-4982-8", doi = "10.1109/ITW.2009.5351447" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20100816-135601648, title = "ISIT 2009", chapter = "Rate regions for coherent and noncoherent multisource network error correction", url = "https://resolver.caltech.edu/CaltechAUTHORS:20100816-135601648", id = "record", isbn = "978-1-4244-4312-3", doi = "10.1109/ISIT.2009.5206077" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20100816-093044500, title = "ISIT 2009", chapter = "On networks with side information", url = "https://resolver.caltech.edu/CaltechAUTHORS:20100816-093044500", id = "record", isbn = "978-1-4244-4312-3", doi = "10.1109/ISIT.2009.5205925" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20100816-110713053, title = "ISIT 2009", chapter = "On the delay of network coding over line networks", url = "https://resolver.caltech.edu/CaltechAUTHORS:20100816-110713053", id = "record", isbn = "978-1-4244-4312-3", doi = "10.1109/ISIT.2009.5205897" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20100816-092052973, title = "ISIT 2009", chapter = "On feedback in network source coding", url = "https://resolver.caltech.edu/CaltechAUTHORS:20100816-092052973", id = "record", isbn = "978-1-4244-4312-3", doi = "10.1109/ISIT.2009.5205920" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20100816-111642548, title = "ISIT 2009", chapter = "A strong converse for a collection of network source coding problems", url = "https://resolver.caltech.edu/CaltechAUTHORS:20100816-111642548", id = "record", isbn = "978-1-4244-4312-3", doi = "10.1109/ISIT.2009.5205934" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20090821-135659881, title = "On Lossless Coding With Coded Side Information", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20090821-135659881", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2009.2021309", volume = "55" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20100722-131717463, title = "Conference record of the 42nd Asilomar Conference on Signals, Systems and Computers", chapter = "On robust network coding subgraph construction under uncertainty", url = "https://resolver.caltech.edu/CaltechAUTHORS:20100722-131717463", id = "record", isbn = "978-1-4244-2940-0", doi = "10.1109/ACSSC.2008.5074828" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20100716-104652225, title = "46th annual Allerton Conference on Communication, Control, and Computing", chapter = "Distributed design of network codes for wireless multiple unicasts", url = "https://resolver.caltech.edu/CaltechAUTHORS:20100716-104652225", id = "record", isbn = "978-1-4244-2925-7", doi = "10.1109/ALLERTON.2008.4797575" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20100716-091516848, title = "46th annual Allerton Conference on Communication, Control, and Computing", chapter = "Network coding with periodic recomputation for minimum energy multicasting in mobile ad-hoc networks", url = "https://resolver.caltech.edu/CaltechAUTHORS:20100716-091516848", id = "record", isbn = "978-1-4244-2925-7", doi = "10.1109/ALLERTON.2008.4797549" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20100716-085815513, title = "46th annual Allerton Conference on Communication, Control, and Computing", chapter = "A Continuity Theory for Lossless Source Coding over Networks", url = "https://resolver.caltech.edu/CaltechAUTHORS:20100716-085815513", id = "record", isbn = "978-1-4244-2925-7", doi = "10.1109/ALLERTON.2008.4797743" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170404-165519201, title = "46th Annual Allerton Conference on Communication, Control, and Computing", chapter = "Network codes with deadlines", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170404-165519201", id = "record", isbn = "978-1-4244-2925-7", doi = "10.1109/ALLERTON.2008.4797577" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:EFFitaw08, title = "Information Theory and Applications Workshop, 2008, Univesity of California, San Diego, 27 January-1 February 2008", chapter = "Optimal multiple description and multiresolution scalar quantizer design", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFitaw08", id = "record", isbn = "978-1-4244-2670-6", doi = "10.1109/ITA.2008.4601027" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:BAKisit08, title = "IEEE International Symposium on Information Theory (ISIT 2008), Toronto, Canada, 6-11 July 2008", chapter = "On achievable rates for multicast in the presence of side information", url = "https://resolver.caltech.edu/CaltechAUTHORS:BAKisit08", id = "record", isbn = "978-1-4244-2256-2", doi = "10.1109/ISIT.2008.4595270" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:GUWisit07, title = "IEEE International Symposium on Information Theory (ISIT 2007), Nice France, 24-29 June 2007", chapter = "On Source Coding with Coded Side Information for a Binary Source with Binary Side Information", url = "https://resolver.caltech.edu/CaltechAUTHORS:GUWisit07", id = "record", isbn = "978-1-4244-1397-3", doi = "10.1109/ISIT.2007.4557427" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:BAKisit07, title = "IEEE International Symposium on Information Theory (ISIT 2007), Nice France, 24-29 June 2007", chapter = "On Network Coding of Independent and Dependent Sources in Line Networks", url = "https://resolver.caltech.edu/CaltechAUTHORS:BAKisit07", id = "record", isbn = "978-1-4244-1397-3", doi = "10.1109/ISIT.2007.4557370" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:EFFisit07, title = "IEEE International Symposium on Information Theory (ISIT 2007), Nice France, 24-29 June 2007", chapter = "Capacity Definitions of General Channels with Receiver Side Information", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFisit07", id = "record", isbn = "978-1-4244-1397-3", doi = "10.1109/ISIT.2007.4557342" } @article{https://resolver.caltech.edu/CaltechAUTHORS:JAGieeetit08, title = "Resilient Network Coding in the Presence of Byzantine Adversaries", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:JAGieeetit08", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2008.921711", volume = "54" } @article{https://resolver.caltech.edu/CaltechAUTHORS:HOTieeetit08, title = "Byzantine Modification Detection in Multicast Networks With Random Network Coding", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:HOTieeetit08", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2008.921894", volume = "54" } @article{https://resolver.caltech.edu/CaltechAUTHORS:MURieeetit08, title = "Quantization as Histogram Segmentation: Optimal Scalar Quantizer Design in Network Systems", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:MURieeetit08", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2007.911170", volume = "54" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:GUWitw07a, title = "Information Theory Workshop (ITW 2007), Tahoe City, CA, 2-6 September 2007", chapter = "On the Continuity of Achievable Rate Regions for Source Coding over Networks", url = "https://resolver.caltech.edu/CaltechAUTHORS:GUWitw07a", id = "record", isbn = "1-4244-1564-0", doi = "10.1109/ITW.2007.4313148" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:GUWitw07b, title = "Information Theory Workshop (ITW 2007), Tahoe City, CA, 2-6 September 2007", chapter = "On Approximating the Rate Region for Source Coding with Coded Side Information", url = "https://resolver.caltech.edu/CaltechAUTHORS:GUWitw07b", id = "record", isbn = "1-4244-1564-0", doi = "10.1109/ITW.2007.4313113" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:LIAitw07, title = "Information Theory Workshop (ITW 2007), Tahoe City, CA, 2-6 September 2007", chapter = "Distortion Metrics of Composite Channels with Receiver Side Information", url = "https://resolver.caltech.edu/CaltechAUTHORS:LIAitw07", id = "record", isbn = "1-4244-1564-0", doi = "10.1109/ITW.2007.4313135" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:MEHicassp07, title = "IEEE International Conference on Acoustics, Speech and Signal Processing, (ICASSP 2007), Honolulu, HI, 15-20 April 2007", chapter = "Optimal Strategies for Efficient Peer-to-Peer File Sharing", url = "https://resolver.caltech.edu/CaltechAUTHORS:MEHicassp07", id = "record", isbn = "1-4244-0728-1", doi = "10.1109/ICASSP.2007.367325" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:KIMinfocomm07, title = "IEEE INFOCOM 2007, IEEE International Conference on Computer Communications, 26th, Anchorage, AK, 6-12 May 2007", chapter = "Evolutionary Approaches To Minimizing Network Coding Resources", url = "https://resolver.caltech.edu/CaltechAUTHORS:KIMinfocomm07", id = "record", isbn = "1-4244-1047-9", doi = "10.1109/INFCOM.2007.231" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:RAYitw06, title = "IEEE Information Theory Workshop (ITW 2006), Punta del Este, Uruguay, 13-17 March 2006", chapter = "On Separation for Multiple Access Channels", url = "https://resolver.caltech.edu/CaltechAUTHORS:RAYitw06", id = "record", isbn = "1-4244-0067-8", doi = "10.1109/ITW.2006.322847" } @article{https://resolver.caltech.edu/CaltechAUTHORS:GOWieeetc07, title = "A Practical Scheme for Wireless Network Operation", journal = "IEEE Transactions on Communications", url = "https://resolver.caltech.edu/CaltechAUTHORS:GOWieeetc07", id = "record", issn = "0090-6778", doi = "10.1109/TCOMM.2007.892448", volume = "55" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:JAGisit06, title = "IEEE International Symposium on Information Theory (ISIT '06), Seattle, WA, 6-12 July 2006", chapter = "Low Complexity Encoding for Network Codes", url = "https://resolver.caltech.edu/CaltechAUTHORS:JAGisit06", id = "record", isbn = "1-4244-0504-1", doi = "10.1109/ISIT.2006.261594" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:GUWisit06, title = "2006 IEEE International Symposium on Information Theory, Seattle, WA, 6-12 July 2006", chapter = "On the Concavity of Rate Regions for Lossless Source Coding in Networks", url = "https://resolver.caltech.edu/CaltechAUTHORS:GUWisit06", id = "record", isbn = "1-4244-0504-1", doi = "10.1109/ISIT.2006.261546" } @article{https://resolver.caltech.edu/CaltechAUTHORS:HOTieeetit06, title = "A Random Linear Network Coding Approach to Multicast", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:HOTieeetit06", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2006.881746", volume = "52" } @article{https://resolver.caltech.edu/CaltechAUTHORS:COLieeetit06, title = "Low-Complexity Approaches to Slepian–Wolf Near-Lossless Distributed Data Compression", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:COLieeetit06", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2006.878215", volume = "52" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:COLitw05, title = "IEEE ISOC Information Theory Workshop on Coding and Complexity (ITW '05), Rotorua, New Zealand, 29 August - 1 September 2005", chapter = "Interference management via capacity-achieving codes for the deterministic broadcast channel", url = "https://resolver.caltech.edu/CaltechAUTHORS:COLitw05", id = "record", isbn = "0 7803 9481 X", doi = "10.1109/ITW.2006.1633821" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:MARitw06, title = "IEEE Information Theory Workshop (ITW '06), Punta del Este, Uruguay, 13-17 March 2006", chapter = "A partial solution for lossless source coding with coded side information", url = "https://resolver.caltech.edu/CaltechAUTHORS:MARitw06", id = "record", isbn = "1-4244-0036-8", doi = "10.1109/ITW.2006.1633821" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:EFFitw06, title = "IEEE Information Theory Workshop (ITW '06), Punta del Este, Uruguay, 13-17 March, 2006", chapter = "A tiling approach to network code design for wireless networks", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFitw06", id = "record", isbn = "1-4244-0035-X", doi = "10.1109/ITW.2006.1633782" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:COLdcc04, title = "Data Compression Conference (DCC 2004), Snowbird, UT, USA, 23-25 March 2004", chapter = "On some new approaches to practical Slepian-Wolf compression inspired by channel coding", url = "https://resolver.caltech.edu/CaltechAUTHORS:COLdcc04", id = "record", isbn = "0 7695 2082 0", doi = "10.1109/DCC.2004.1281473" } @article{https://resolver.caltech.edu/CaltechAUTHORS:RAMieeetit06, title = "Separating distributed source coding from network coding", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:RAMieeetit06", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2006.874534", volume = "52" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:COLdcc06, title = "Data Compression Conference (DCC '06), Snowbird, UT, 28-30 March 2006", chapter = "Time-sharing vs. source-splitting in the Slepian-Wolf problem: error exponents analysis", url = "https://resolver.caltech.edu/CaltechAUTHORS:COLdcc06", id = "record", isbn = "0 7695 2545 8", doi = "10.1109/DCC.2006.77" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:GUWdcc06, title = "DCC 2006 -- Data Compression Conference, March 28-30, 2006, Snowbird, Utah", chapter = "On Multi-Resolution Coding and a Two-Hop Network", url = "https://resolver.caltech.edu/CaltechAUTHORS:GUWdcc06", id = "record", isbn = "0-7695-2545-8", doi = "10.1109/DCC.2006.58" } @article{https://resolver.caltech.edu/CaltechAUTHORS:FLEieeetit06, title = "On rate-distortion with mixed types of side information", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:FLEieeetit06", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2006.871059", volume = "52" } @article{https://resolver.caltech.edu/CaltechAUTHORS:DANieeetit06a, title = "Capacity of wireless erasure networks", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:DANieeetit06a", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2005.864424", volume = "52" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:COLwir05, title = "International Conference on Wireless Networks, Communications and Mobile Computing, Maui, HI, 13-16 June 2005", chapter = "Linear complexity universal decoding with exponential error probability decay", url = "https://resolver.caltech.edu/CaltechAUTHORS:COLwir05", id = "record", isbn = "0 7803 9305 8", doi = "10.1109/WIRLES.2005.1549651" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:JAGisit05, title = "International Symposium on Information Theory (ISIT 2005), Adelaide, South Australia, Australia, 4-9 September 2005", chapter = "Correction of adversarial errors in networks", url = "https://resolver.caltech.edu/CaltechAUTHORS:JAGisit05", id = "record", isbn = "0-7803-9151-9", doi = "10.1109/ISIT.2005.1523584" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:COLisit05, title = "International Symposium on Information Theory (ISIT 2005), Adelaide, South Australia, Australia, 4-9 September 2005", chapter = "Rate-splitting for the deterministic broadcast channel", url = "https://resolver.caltech.edu/CaltechAUTHORS:COLisit05", id = "record", isbn = "0-7803-9151-9", doi = "10.1109/ISIT.2005.1523735" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:FENisit05, title = "International Symposium on Information Theory (ISIT 2005), Adelaide, South Australia, Australia, 4-9 September 2005", chapter = "On the rate loss and construction of source codes for broadcast channels", url = "https://resolver.caltech.edu/CaltechAUTHORS:FENisit05", id = "record", isbn = "0-7803-9151-9", doi = "10.1109/ISIT.2005.1523297" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:LUNisit05, title = "International Symposium on Information Theory (ISIT 2005), Adelaide, South Australia, Australia, 4-9 September 2005", chapter = "Further results on coding for reliable communication over packet networks", url = "https://resolver.caltech.edu/CaltechAUTHORS:LUNisit05", id = "record", isbn = "0-7803-9151-9", doi = "10.1109/ISIT.2005.1523665" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:GUWisit05, chapter = "Source coding for a simple multi-hop network", url = "https://resolver.caltech.edu/CaltechAUTHORS:GUWisit05", id = "record" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:HOTiwwan04, title = "International Workshop on Wireless Ad-Hoc Networks, Oulu, Finald, May 31-June 3, 2004", chapter = "On the utility of network coding in dynamic environments", url = "https://resolver.caltech.edu/CaltechAUTHORS:HOTiwwan04", id = "record", isbn = "0-7803-8275-7", doi = "10.1109/IWWAN.2004.1525570" } @article{https://resolver.caltech.edu/CaltechAUTHORS:JAGieeetit05, title = "Polynomial time algorithms for multicast network code construction", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:JAGieeetit05", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2005.847712", volume = "51" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:GUWdcc05, title = "DCC 2005 : Data Compression Conference, March 29-31, 2005, Snowbird, Utah", chapter = "Source Coding for a Multihop Network", url = "https://resolver.caltech.edu/CaltechAUTHORS:GUWdcc05", id = "record", isbn = "9780769523095", doi = "10.1109/DCC.2005.82" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:COLdcc05, title = "Data Compression Conference (DCC '05), Snowbird, UT, 29-31 March 2005", chapter = "Towards practical minimum-entropy universal decoding", url = "https://resolver.caltech.edu/CaltechAUTHORS:COLdcc05", id = "record", isbn = "0 7695 2309 9", doi = "10.1109/DCC.2005.90" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:EFFitw04, title = "IEEE Information Theory Workshop (ITW '04), San Antonio, TX, 24-29 October 2004", chapter = "On source and channel codes for multiple inputs and outputs: does multiple description beat space time?", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFitw04", id = "record", isbn = "0 7803 8720 1", doi = "10.1109/ITW.2004.1405323" } @article{https://resolver.caltech.edu/CaltechAUTHORS:FENieeetit05, title = "On the rate loss of multiple description source codes", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:FENieeetit05", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2004.840900", volume = "51" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:EFFisit04, title = "IEEE International Symposium on Information Theory (ISIT '04), Chicago, IL, 27 June - 2 July 2004", chapter = "Rapid near-optimal VQ design with a deterministic data net", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFisit04", id = "record", isbn = "0-7803-8280-3", doi = "10.1109/ISIT.2004.1365336" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:HOTisit04, title = "IEEE International Symposium on Information Theory (ISIT '04), Chicago, IL, 27 June-2 July 2004", chapter = "Byzantine modification detection in multicast networks using randomized network coding", url = "https://resolver.caltech.edu/CaltechAUTHORS:HOTisit04", id = "record", isbn = "0-7803-8280-3", doi = "10.1109/ISIT.2004.1365180" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:COLisit04, title = "IEEE International Symposium on Information Theory (ISIT '04), Chicago, IL, 27 June-2 July 2004", chapter = "A new source-splitting approach to the Slepian-Wolf problem", url = "https://resolver.caltech.edu/CaltechAUTHORS:COLisit04", id = "record", isbn = "0 7803 8280 3", doi = "10.1109/ISIT.2004.1365369" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:ZHAisit04, title = "IEEE International Symposium on Information Theory (ISIT '04), Chicago, Illinois, 27 June-2 July 2004", chapter = "Uniquely decodable multiple access source codes", url = "https://resolver.caltech.edu/CaltechAUTHORS:ZHAisit04", id = "record", isbn = "0-7803-8280-3", doi = "10.1109/ISIT.2004.1365234" } @article{https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit04a, title = "Multiresolution vector quantization", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit04a", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2004.838381", volume = "50" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:ZHAdcc04, title = "Data Compression Conference (DCC '04), Snowbird, UT, 23-25 March 2004", chapter = "Multiresolution source coding using entropy constrained dithered scalar quantization", url = "https://resolver.caltech.edu/CaltechAUTHORS:ZHAdcc04", id = "record", isbn = "0769520820", doi = "10.1109/DCC.2004.1281447" } @article{https://resolver.caltech.edu/CaltechAUTHORS:FLEieeetit02, title = "Network vector quantization", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:FLEieeetit02", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2004.831832", volume = "50" } @article{https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit04b, title = "Suboptimality of the Karhunen-Loève transform for transform coding", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit04b", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2004.831787", volume = "50" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:GOWisit04, title = "IEEE International Symposium on Information Theory (ISIT '04), Chicago, IL, 27 June-2 July 2004", chapter = "On the capacity of wireless erasure networks", url = "https://resolver.caltech.edu/CaltechAUTHORS:GOWisit04", id = "record", isbn = "0 7803 8280 3", doi = "10.1109/ISIT.2004.1365437" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:FENisit02, title = "IEEE International Symposium on Information Theory (ISIT '02), Lausanne, Switzerland, 30 June-5 July 2002", chapter = "On the rate loss of multiple description source codes and additive successive refinement codes", url = "https://resolver.caltech.edu/CaltechAUTHORS:FENisit02", id = "record", isbn = "0-7803-7501-7", doi = "10.1109/ISIT.2002.1023366" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:JAGisit04, title = "International Symposium on Information Theory (ISIT '04), Chicago, IL, 27 June-2 July 2004", chapter = "Communication and distributional complexity of joint probability mass functions", url = "https://resolver.caltech.edu/CaltechAUTHORS:JAGisit04", id = "record", isbn = "0-7803-8280-3", doi = "10.1109/ISIT.2004.1365399" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:DANasilo03, title = "Asilomar Conference on Signals, Systems and Computers, 37th, Pacific Grove, CA, 9-12 November 2003", chapter = "Is broadcast plus multiaccess optimal for Gaussian wireless networks?", url = "https://resolver.caltech.edu/CaltechAUTHORS:DANasilo03", id = "record", isbn = "0780381041", doi = "10.1109/ACSSC.2003.1292284" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:FENisit03, title = "IEEE International Symposium on Information Theory (ISIT '03), Yokohama, Japan, 29 June-4 July, 2003", chapter = "On the achievable region for multiple description source codes on Gaussian sources", url = "https://resolver.caltech.edu/CaltechAUTHORS:FENisit03", id = "record", isbn = "0-7803-7728-1", doi = "10.1109/ISIT.2003.1228209" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:HOTisit03a, title = "IEEE International Symposium on Information Theory (ISIT '04), Chicago, IL, 27 June-2 July, 2004", chapter = "The benefits of coding over routing in a randomized setting", url = "https://resolver.caltech.edu/CaltechAUTHORS:HOTisit03a", id = "record", isbn = "0-7803-7728-1", doi = "10.1109/ISIT.2003.1228459" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:FLEisit03, title = "IEEE International Symposium on Information Theory, 2003, Yokohama, Japan, June 29-July 4, 2003", chapter = "Rate-distortion with mixed types of side information", url = "https://resolver.caltech.edu/CaltechAUTHORS:FLEisit03", id = "record", isbn = "0-7803-7728-1", doi = "10.1109/ISIT.2003.1228158" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:FENdcc03, title = "Data Compression Conference (DCC '03), Snowbird, UT, 25-27 March 2003", chapter = "Network source coding using entropy constrained dithered quantization", url = "https://resolver.caltech.edu/CaltechAUTHORS:FENdcc03", id = "record", isbn = "0-7695-1896-6", doi = "10.1109/DCC.2003.1194046" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:ZHAdcc03, title = "Data Compression Conference (DCC '03), Snowbird, UT, 25-27 March 2003", chapter = "Low complexity code design for lossless and near-lossless side information source codes", url = "https://resolver.caltech.edu/CaltechAUTHORS:ZHAdcc03", id = "record", isbn = "0-7695-1896-6" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:EFFdcc03, title = "DCC 2003, Data Compression Conference, Snowbird, UT, 23-25 March 2003", chapter = "Suboptimality of the Karhunen-Loève transform for transform coding", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFdcc03", id = "record", isbn = "0-7695-1896-6", doi = "10.1109/DCC.2003.1194020" } @article{https://resolver.caltech.edu/CaltechAUTHORS:FENieeetit03, title = "Improved bounds for the rate loss of multiresolution source codes", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:FENieeetit03", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2003.809604", volume = "49" } @article{https://resolver.caltech.edu/CaltechAUTHORS:ZHAieeetit03, title = "Lossless and near-lossless source coding for multiple access networks", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:ZHAieeetit03", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2002.806145", volume = "49" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20150210-075301992, title = "Advances in Network Information Theory", chapter = "Linear network codes: A unified framework for source, channel, and network coding", url = "https://resolver.caltech.edu/CaltechAUTHORS:20150210-075301992", id = "record", isbn = "0821834673" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20150212-071001793, chapter = "Should we break a wireless network into sub-networks?", url = "https://resolver.caltech.edu/CaltechAUTHORS:20150212-071001793", id = "record" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:EFFdcc02, title = "DCC 2002 -- Data Compression Conference, 2-4 April, 2002, Snowbird, Utah", chapter = "Codecell contiguity in optimal fixed-rate and entropy-constrained network scalar quantizers", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFdcc02", id = "record", isbn = "0-7695-1477-4", doi = "10.1109/DCC.2002.999969" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:Efficip95, title = "International Conference on Image Processing (ICIP '95), Washington, DC, 23-26 October 1995", chapter = "Weighted universal transform coding: universal image compression with the Karhunen-Loève transform", url = "https://resolver.caltech.edu/CaltechAUTHORS:Efficip95", id = "record", isbn = "0 7803 3122 2", doi = "10.1109/ICIP.1995.537415" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:DUGasilo99, title = "Asilomar Conference on Signals, Systems and Computers, 32nd, Pacific Grove, CA, 1-4 November 1998", chapter = "Multi-resolution VQ: parameter meaning and choice", url = "https://resolver.caltech.edu/CaltechAUTHORS:DUGasilo99", id = "record", isbn = "0 7803 5148 7", doi = "10.1109/ACSSC.1998.750846" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:VARdcc00, title = "DCC 2000: proceedings, Data Compression Conference, March 28-30, 2000, Snowbird, Utah", chapter = "Multi-resolution adaptation of the SPIHT algorithm for multiple description", url = "https://resolver.caltech.edu/CaltechAUTHORS:VARdcc00", id = "record", isbn = "0769505929", doi = "10.1109/DCC.2000.838170" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:EFFicassp97b, title = "International Conference on Acoustics, Speech, and Signal Processing (ICASSP '97), Munich, Germany, 21-24 April 1997", chapter = "Robustness to channel variation in source coding for transmission across noisy channels", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFicassp97b", id = "record", isbn = "0 8186 7919 0", doi = "10.1109/ICASSP.1997.595413" } @article{https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit02, title = "Universal lossless source coding with the Burrows Wheeler transform", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit02", id = "record", issn = "0018-9448", doi = "10.1109/18.995542", volume = "48" } @article{https://resolver.caltech.edu/CaltechAUTHORS:FENieeetip02, title = "On the rate-distortion performance and computational efficiency of the Karhunen-Loeve transform for lossy data compression", journal = "IEEE Transactions on Image Processing", url = "https://resolver.caltech.edu/CaltechAUTHORS:FENieeetip02", id = "record", issn = "1057-7149", doi = "10.1109/83.982819", volume = "11" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:JAGisit02, title = "IEEE International Symposium on Information Theory (ISIT '02), Lausanne, Switzerland, 30 June-5 July 2002", chapter = "Universal linked multiple access source codes", url = "https://resolver.caltech.edu/CaltechAUTHORS:JAGisit02", id = "record", isbn = "0-7803-7501-7", doi = "10.1109/ISIT.2002.1023367" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:ZHAasilo02, title = "Asilomar Conference on Signals, Systems \& Computers, 36th, Pacific Grove, CA, 3-6 November 2002", chapter = "Side information source coding: low complexity design and source independence", url = "https://resolver.caltech.edu/CaltechAUTHORS:ZHAasilo02", id = "record", isbn = "0-7803-7576-9", doi = "10.1109/ACSSC.2002.1197187" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:MURdcc02, title = "Data Compression Conference (DCC '02), Snowbird, UT, 2-4 April 2002", chapter = "Quantization as histogram segmentation: globally optimal scalar quantizer design in network systems", url = "https://resolver.caltech.edu/CaltechAUTHORS:MURdcc02", id = "record", isbn = "0-7695-1477-4", doi = "10.1109/DCC.2002.999968" } @article{https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit01, title = "Universal multiresolution source codes", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit01", id = "record", issn = "0018-9448", doi = "10.1109/18.945238", volume = "47" } @article{https://resolver.caltech.edu/CaltechAUTHORS:GOLieeetit01, title = "The capacity region of broadcast channels with intersymbol interference and colored Gaussian noise", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:GOLieeetit01", id = "record", issn = "0018-9448", doi = "10.1109/18.904524", volume = "47" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:ZHAisit01, title = "IEEE International Symposium on Information Theory (ISIT '01), Washington, DC, 24-29 June 2001", chapter = "Lossless source coding for multiple access networks", url = "https://resolver.caltech.edu/CaltechAUTHORS:ZHAisit01", id = "record", isbn = "0-7803-7123-2", doi = "10.1109/ISIT.2001.936148" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:FENisit01, title = "IEEE International Symposium on Information Theory (ISIT '01), Washington, DC, 24-29 June 2001", chapter = "Improved bounds for the rate loss of multi-resolution source codes", url = "https://resolver.caltech.edu/CaltechAUTHORS:FENisit01", id = "record", isbn = "0-7803-7123-2", doi = "10.1109/ISIT.2001.936056" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:ZHAdcc01, title = "Data Compression Conference (DCC '01), Snowbird, UT, 27-29 March 2001", chapter = "Optimal code design for lossless and near lossless source coding in multiple access networks", url = "https://resolver.caltech.edu/CaltechAUTHORS:ZHAdcc01", id = "record", isbn = "0-7695-0592-9", doi = "10.1109/DCC.2001.917157" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:FLEdcc01, title = "Data Compression Conference (DCC '01), Snowbird, UT, 27-29 March 2001", chapter = "Network Vector Quantization", url = "https://resolver.caltech.edu/CaltechAUTHORS:FLEdcc01", id = "record", isbn = "0 7695 1031 0" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20181204-132725764, title = "Wavelet Applications in Signal and Image Processing VIII", chapter = "Setting priorities: a new SPIHT-compatible algorithm for image compression", url = "https://resolver.caltech.edu/CaltechAUTHORS:20181204-132725764", id = "record", isbn = "9780819437648", doi = "10.1117/12.408670" } @article{https://resolver.caltech.edu/CaltechAUTHORS:EFFprocieee00, title = "PPM performance with BWT complexity: a fast and effective data compression algorithm", journal = "Proceedings of the IEEE", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFprocieee00", id = "record", issn = "0018-9219", doi = "10.1109/5.892706", volume = "88" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:FLEisit00, title = "International Symposium on Information Theory (ISIT '00), Sorrento, Italy, 25-30 June 2000", chapter = "The rate distortion region for the multiple description problem", url = "https://resolver.caltech.edu/CaltechAUTHORS:FLEisit00", id = "record", isbn = "0 7803 5857 0", doi = "10.1109/ISIT.2000.866506" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:EFFdcc00, title = "Data Compression Conference (DCC 2000), Snowbird, UT, 28-30 March 2000", chapter = "PPM performance with BWT complexity: a new method for lossless data compression", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFdcc00", id = "record", isbn = "0 7695 0592 9", doi = "10.1109/DCC.2000.838160" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:SHEglobecom00, title = "IEEE Global Telecommunications Conference (GLOBECOM '00), San Francisco, CA, 27 November-1 December 2000", chapter = "Joint design of vector quantizers and RCPC channel codes for Rayleigh fading channels", url = "https://resolver.caltech.edu/CaltechAUTHORS:SHEglobecom00", id = "record", isbn = "0-7803-6451-1", doi = "10.1109/GLOCOM.2000.891910" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:ZHAdcc00, title = "Data Compression Conference (DCC '00), Snowbird, UT, 28-30 March 2000", chapter = "Lossless and lossy broadcast system source codes: theoretical limits, optimal design, and empirical performance", url = "https://resolver.caltech.edu/CaltechAUTHORS:ZHAdcc00", id = "record", isbn = "0-7695-0592-9", doi = "10.1109/DCC.2000.838146" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:FENisit00, title = "IEEE International Symposium on Information Theory (ISIT '00), Sorrento, Italy, 25-30 June 2000", chapter = "Multi-resolution channel codes", url = "https://resolver.caltech.edu/CaltechAUTHORS:FENisit00", id = "record", isbn = "0-7803-5857-0", doi = "10.1109/ISIT.2000.866785" } @article{https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetip99, title = "Weighted universal image compression", journal = "IEEE Transactions on Image Processing", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetip99", id = "record", issn = "1057-7149", doi = "10.1109/83.791958", volume = "8" } @article{https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit99, title = "Distortion-rate bounds for fixed- and variable-rate multiresolution source codes", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit99", id = "record", issn = "0018-9448", doi = "10.1109/18.782109", volume = "45" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:FLEdcc99, title = "Data Compression Conference (DCC '99), Snowbird, UT, 29-31 March 1999", chapter = "Generalized multiple description vector quantization", url = "https://resolver.caltech.edu/CaltechAUTHORS:FLEdcc99", id = "record", isbn = "0 7695 0096 X", doi = "10.1109/DCC.1999.755648" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:ZHAasilo99, title = "Asilomar Conference on Signals, Systems, \& Computers, 33rd, Pacific Grove, CA, 24-27 October 1999", chapter = "Broadcast system source codes: a new paradigm for data compression", url = "https://resolver.caltech.edu/CaltechAUTHORS:ZHAasilo99", id = "record", isbn = "0-7803-5701-9", doi = "10.1109/ACSSC.1999.832348" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:EFFdcc99, title = "DCC 1999 -- Data Compression Conference, 29-31 March, 1999, Snowbird, Utah", chapter = "Universal lossless source coding with the Burrows Wheeler transform", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFdcc99", id = "record", isbn = "0-7695-0096-X", doi = "10.1109/DCC.1999.755667" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:FENicassp99, title = "IEEE International Conference on Acoustics, Speech, and Signal (ICASSP '99), Phoenix, AZ, 15-19 March 1999", chapter = "Separable Karhunen Loeve transforms for the weighted universal transform coding algorithm", url = "https://resolver.caltech.edu/CaltechAUTHORS:FENicassp99", id = "record", isbn = "0-7803-5041-3", doi = "10.1109/ICASSP.1999.760622" } @article{https://resolver.caltech.edu/CaltechAUTHORS:EFFieeespm98, title = "Optimal modeling for complex system design", journal = "IEEE Signal Processing Magazine", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFieeespm98", id = "record", issn = "1053-5888", doi = "10.1109/79.733496", volume = "15" } @article{https://resolver.caltech.edu/CaltechAUTHORS:GOLieeetc98, title = "Joint design of fixed-rate source codes and multiresolution channel codes", journal = "IEEE Transactions on Communications", url = "https://resolver.caltech.edu/CaltechAUTHORS:GOLieeetc98", id = "record", issn = "0090-6778", doi = "10.1109/26.725308", volume = "46" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:TIEasilo98, title = "Asilomar Conference on Signals, Systems and Computers, 32nd, Pacific Grove, CA, 1-4 November 1998", chapter = "Joint design of fixed-rate source codes and UEP channel codes for fading channels", url = "https://resolver.caltech.edu/CaltechAUTHORS:TIEasilo98", id = "record", isbn = "0-7803-5148-7", doi = "10.1109/ACSSC.1998.750834" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:EFFdcc98, title = "Data Compression Conference (DCC '98), Snowbird, UT, 30 March-1 April 1998", chapter = "Practical multi-resolution source coding: TSVQ revisited", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFdcc98", id = "record", isbn = "0 8186 8406 2", doi = "10.1109/DCC.1998.672131" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:EFFisit98b, title = "IEEE International Symposium on Information Theory (ISIT '98), Cambridge, MA, 16-21 August 1998", chapter = "Capacity definitions and coding strategies for general channels with receiver side information", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFisit98b", id = "record", isbn = "0-7803-5000-6", doi = "10.1109/ISIT.1998.708619" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:EFFisit98a, title = "IEEE International Symposium on Information Theory (ISIT '98), Cambridge, MA, 16-21 August 1998", chapter = "Multi-resolution source coding theorems", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFisit98a", id = "record", isbn = "0-7803-5001-4", doi = "10.1109/ISIT.1998.708829" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:EFFicip97, title = "International Conference on Image Processing, Santa Barbara, CA, 26-29 Oct. 1997", chapter = "Zerotree design for image compression: toward weighted universal zerotree coding", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFicip97", id = "record", isbn = "0 8186 8183 7", doi = "10.1109/ICIP.1997.647988" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:GOLicc97, title = "International Conference on Communications (ICC '97), Montreal, Que., Canada, 8-12 June 1997", chapter = "Iterative joint design of source codes and multiresolution channel codes", url = "https://resolver.caltech.edu/CaltechAUTHORS:GOLicc97", id = "record", isbn = "0 7803 3925 8", doi = "10.1109/ICC.1997.605283" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:EFFdcc97, title = "Data Compression Conference (DCC '97), Snowbird, Utah, 25-27 March 1997", chapter = "Fast weighted universal transform coding: toward optimal, low complexity bases for image compression", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFdcc97", id = "record", isbn = "0-8186-7761-9", doi = "10.1109/DCC.1997.582021" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:GOLisit97, title = "International Symposium on Information Theory (ISIT '97), Ulm, Germany, 29 June-4 July 1997", chapter = "The capacity region of broadcast channels with memory", url = "https://resolver.caltech.edu/CaltechAUTHORS:GOLisit97", id = "record", isbn = "0 7803 3956 8", doi = "10.1109/ISIT.1997.612943" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:EFFicassp97a, title = "IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '97), Munich, Germany, 21-24 April 1997", chapter = "Conditional weighted universal source codes: second order statistics in universal coding", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFicassp97a", id = "record", isbn = "0 8186 7919 0", doi = "10.1109/ICASSP.1997.595354" } @article{https://resolver.caltech.edu/CaltechAUTHORS:CHOieeetit96, title = "A vector quantization approach to universal noiseless coding and quantization", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:CHOieeetit96", id = "record", issn = "0018-9448", doi = "10.1109/18.508836", volume = "42" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:CHOisit95, title = "IEEE International Symposium on Information Theory (ISIT '95), Whistler, British Columbia, Canada, 17-22 September 1995", chapter = "Universal quantization of parametric sources has redundancy k/2 (log n)/n", url = "https://resolver.caltech.edu/CaltechAUTHORS:CHOisit95", id = "record", isbn = "0-7803-2454-4", doi = "10.1109/ISIT.1995.550358" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:CHEisit95a, title = "IEEE International Symposium on Information Theory (ISIT '95), Whistler, British Columbia, 17-22 September 1995", chapter = "Data expansion with Huffman codes", url = "https://resolver.caltech.edu/CaltechAUTHORS:CHEisit95a", id = "record", isbn = "0-7803-2453-6", doi = "10.1109/ISIT.1995.531102" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:EFFicassp95, title = "IEEE International Conference on Acoustics, Speech, and Signal (ICASSP '95), Detroit, MI, 9-12 May 1995", chapter = "Weighted universal bit allocation: optimal multiple quantization matrix coding", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFicassp95", id = "record", isbn = "0-7803-2431-5", doi = "10.1109/ICASSP.1995.479962" } @article{https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit94b, title = "Variable-rate source coding theorems for stationary nonergodic sources", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit94b", id = "record", issn = "0018-9448", doi = "10.1109/18.340466", volume = "40" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:EFFdcc94, title = "Data Compression Conference (4th : 1994 : Snowbird, Utah)", chapter = "Variable dimension weighted universal vector quantization and noiseless coding", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFdcc94", id = "record", isbn = "0-8186-5637-9", doi = "10.1109/DCC.1994.305907" } @article{https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit94a, title = "A Progressive Universal Noiseless Coder", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit94a", id = "record", issn = "0018-9448", doi = "10.1109/18.272460", volume = "40" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:PERasilo94, title = "Asilomar Conference on Signals, Systems and Computers, 28th, Pacific Grove, CA, 31 October-2 November 1998", chapter = "An iterative joint codebook and classifier improvement algorithm for finite-state vector quantization", url = "https://resolver.caltech.edu/CaltechAUTHORS:PERasilo94", id = "record", isbn = "0-8186-6405-3", doi = "10.1109/ACSSC.1994.471542" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:EFFicassp94, title = "IEEE International Conference on Acoustics, Speech, and Signal (ICASSP '94), Adelaide, Australia, 19-22 April 1994", chapter = "One-pass adaptive universal vector quantization", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFicassp94", id = "record", isbn = "0-7803-1775-0", doi = "10.1109/ICASSP.1994.389437" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:EFFisit94a, title = "IEEE International Symposium on Information Theory (ISIT '94), Trondheim, Norway, 27 June - 1 July 1994", chapter = "Rates of convergence in adaptive universal vector quantization", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFisit94a", id = "record", isbn = "0-7803-2015-8", doi = "10.1109/ISIT.1994.395071" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:EFFisit94b, title = "IEEE International Symposium on Information Theory (ISIT '94), Trondheim, Norway, 27 June - 1 July 1994", chapter = "Variable-rate source coding theorems for stationary nonergodic sources", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFisit94b", id = "record", isbn = "0-7803-2015-8", doi = "10.1109/ISIT.1994.395006" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:CHOisit93, title = "IEEE International Symposium on Information Theory, ISIT93, San Antonio, TX, 17-22 January 1993", chapter = "Rate and distortion redundancies for universal source coding with respect to a fidelity criterion", url = "https://resolver.caltech.edu/CaltechAUTHORS:CHOisit93", id = "record", isbn = "0-7803-0878-6" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:ANDdcc93, title = "Data Compression Conference (3rd : 1993 : Snowbird, Utah)", chapter = "A mean-removed variation of weighted universal vector quantization for image coding", url = "https://resolver.caltech.edu/CaltechAUTHORS:ANDdcc93", id = "record", isbn = "0-8186-3392-1", doi = "10.1109/DCC.1993.253119" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:EFFisit91, title = "IEEE International Symposium on Information Technology (ISIT 91), Budapest, Hungary, 24-28 June 1991", chapter = "A Progressive Universal Noiseless Coder", url = "https://resolver.caltech.edu/CaltechAUTHORS:EFFisit91", id = "record", isbn = "0-7803-0056-4" }