@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", year = "2023", url = "https://authors.library.caltech.edu/records/d2gvc-3yj77", id = "record", issn = "0018-9448", doi = "10.1109/tit.2023.3338632" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20230502-16744400.1, title = "Reliability Function for Streaming Over a DMC With Feedback", journal = "IEEE Transactions on Information Theory", year = "2023", url = "https://resolver.caltech.edu/CaltechAUTHORS:20230502-16744400.1", id = "record", issn = "0018-9448", doi = "10.1109/tit.2022.3225167", volume = "69" } @article{https://authors.library.caltech.edu/records/3xata-0nk41, title = "Guest Editorial Special Issue on the Role of Freshness and Semantic Measures in the Transmission of Information for Next-Generation Networks", journal = "IEEE Journal on Selected Areas in Information Theory", year = "2023", url = "https://authors.library.caltech.edu/records/3xata-0nk41", id = "record", issn = "2641-8770", doi = "10.1109/jsait.2024.3352988", volume = "4" } @other{https://resolver.caltech.edu/CaltechAUTHORS:20221222-234257392, title = "Feedback capacity of Gaussian channels with memory", year = "2022", url = "https://resolver.caltech.edu/CaltechAUTHORS:20221222-234257392", id = "record", doi = "10.48550/arXiv.2207.10580" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20221031-572094900.1, title = "How to Query an Oracle? Efficient Strategies to Label Data", journal = "IEEE Transactions on Pattern Analysis and Machine Intelligence", year = "2022", url = "https://resolver.caltech.edu/CaltechAUTHORS:20221031-572094900.1", id = "record", issn = "0162-8828", doi = "10.1109/tpami.2021.3118644", volume = "44" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20211217-98215000, title = "Exact minimum number of bits to stabilize a linear system", journal = "IEEE Transactions on Automatic Control", year = "2022", url = "https://resolver.caltech.edu/CaltechAUTHORS:20211217-98215000", id = "record", issn = "0018-9286", doi = "10.1109/tac.2021.3126679", volume = "67" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20220909-232702000, title = "Differentially Quantized Gradient Methods", journal = "IEEE Transactions on Information Theory", year = "2022", url = "https://resolver.caltech.edu/CaltechAUTHORS:20220909-232702000", id = "record", issn = "0018-9448", doi = "10.1109/tit.2022.3171173", volume = "68" } @other{https://resolver.caltech.edu/CaltechAUTHORS:20220804-201321456, title = "Reducing the LQG Cost with Minimal Communication", year = "2022", url = "https://resolver.caltech.edu/CaltechAUTHORS:20220804-201321456", id = "record", doi = "10.48550/arXiv.2109.12246" } @other{https://resolver.caltech.edu/CaltechAUTHORS:20220804-201317566, title = "How to Query An Oracle? Efficient Strategies to Label Data", year = "2022", url = "https://resolver.caltech.edu/CaltechAUTHORS:20220804-201317566", id = "record", doi = "10.48550/arXiv.2110.02341" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20220804-765679000, title = "2022 IEEE International Symposium on Information Theory (ISIT)", chapter = "Feedback Capacity of Gaussian Channels with Memory", year = "2022", url = "https://resolver.caltech.edu/CaltechAUTHORS:20220804-765679000", id = "record", isbn = "978-1-6654-2159-1", doi = "10.1109/isit50566.2022.9834799" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20220804-765691000, title = "2022 IEEE International Symposium on Information Theory (ISIT)", chapter = "Variable-Length Stop-Feedback Codes With Finite Optimal Decoding Times for BI-AWGN Channels", year = "2022", url = "https://resolver.caltech.edu/CaltechAUTHORS:20220804-765691000", id = "record", isbn = "978-1-6654-2159-1", doi = "10.1109/isit50566.2022.9834526" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20220804-765703000, title = "2022 IEEE International Symposium on Information Theory (ISIT)", chapter = "Reliability function for streaming over a DMC with feedback", year = "2022", url = "https://resolver.caltech.edu/CaltechAUTHORS:20220804-765703000", id = "record", isbn = "978-1-6654-2159-1", doi = "10.1109/isit50566.2022.9834852" } @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", year = "2022", 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-201311712, title = "Variable-Length Coding for Binary-Input Channels With Limited Stop Feedback", year = "2022", url = "https://resolver.caltech.edu/CaltechAUTHORS:20220804-201311712", id = "record", doi = "10.48550/arXiv.2205.15399" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20210412-071230573, title = "Optimal Causal Rate-Constrained Sampling of the Wiener Process", journal = "IEEE Transactions on Automatic Control", year = "2022", url = "https://resolver.caltech.edu/CaltechAUTHORS:20210412-071230573", id = "record", issn = "0018-9286", doi = "10.1109/tac.2021.3071953", volume = "67" } @other{https://resolver.caltech.edu/CaltechAUTHORS:20230504-968774000.1, title = "Reliability function for streaming over a DMC with feedback", year = "2022", url = "https://resolver.caltech.edu/CaltechAUTHORS:20230504-968774000.1", id = "record" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20211222-322820000, title = "Optimal Causal Rate-Constrained Sampling for a Class of Continuous Markov Processes", journal = "IEEE Transactions on Information Theory", year = "2021", url = "https://resolver.caltech.edu/CaltechAUTHORS:20211222-322820000", id = "record", issn = "0018-9448", doi = "10.1109/tit.2021.3114142", volume = "67" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20211222-495165300, title = "The CEO Problem With Inter-Block Memory", journal = "IEEE Transactions on Information Theory", year = "2021", url = "https://resolver.caltech.edu/CaltechAUTHORS:20211222-495165300", id = "record", issn = "0018-9448", doi = "10.1109/tit.2021.3111658", volume = "67" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20211122-171053652, title = "Gaussian Multiple and Random Access Channels: Finite-Blocklength Analysis", journal = "IEEE Transactions on Information Theory", year = "2021", 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", year = "2021", 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", year = "2021", url = "https://resolver.caltech.edu/CaltechAUTHORS:20210825-143502652", id = "record", issn = "0018-9448", doi = "10.1109/tit.2021.3100806", volume = "67" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20210323-145545445, title = "2021 IEEE International Symposium on Information Theory", chapter = "Instantaneous SED coding over a DMC", year = "2021", url = "https://resolver.caltech.edu/CaltechAUTHORS:20210323-145545445", id = "record", isbn = "9781538682098", doi = "10.1109/ISIT45174.2021.9518087" } @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", year = "2021", url = "https://resolver.caltech.edu/CaltechAUTHORS:20210329-152031630", id = "record", isbn = "978-1-5386-8209-8", doi = "10.1109/ISIT45174.2021.9517993" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20210719-210210078, title = "2021 IEEE International Symposium on Information Theory", chapter = "Feedback Capacity of MIMO Gaussian Channels", year = "2021", url = "https://resolver.caltech.edu/CaltechAUTHORS:20210719-210210078", id = "record", isbn = "978-1-5386-8209-8", doi = "10.1109/ISIT45174.2021.9518088" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200214-105624458, title = "2021 IEEE International Symposium on Information Theory (ISIT)", chapter = "Differentially Quantized Gradient Descent", year = "2021", url = "https://resolver.caltech.edu/CaltechAUTHORS:20200214-105624458", id = "record", isbn = "978-1-5386-8209-8", doi = "10.1109/ISIT45174.2021.9518254" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20210113-163504947, title = "Random Access Channel Coding in the Finite Blocklength Regime", journal = "IEEE Transactions on Information Theory", year = "2021", 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:20210205-093044649, title = "Stabilizing a System With an Unbounded Random Gain Using Only Finitely Many Bits", journal = "IEEE Transactions on Information Theory", year = "2021", url = "https://resolver.caltech.edu/CaltechAUTHORS:20210205-093044649", id = "record", issn = "0018-9448", doi = "10.1109/tit.2021.3053140", volume = "67" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20210211-151615781, title = "Nonstationary Gauss-Markov Processes: Parameter Estimation and Dispersion", journal = "IEEE Transactions on Information Theory", year = "2021", url = "https://resolver.caltech.edu/CaltechAUTHORS:20210211-151615781", id = "record", issn = "0018-9448", doi = "10.1109/tit.2021.3050342", volume = "67" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20191004-135310393, title = "Two-Layer Coded Channel Access With Collision Resolution: Design and Analysis", journal = "IEEE Transactions on Wireless Communications", year = "2020", url = "https://resolver.caltech.edu/CaltechAUTHORS:20191004-135310393", id = "record", issn = "1536-1276", doi = "10.1109/TWC.2020.3018472", volume = "19" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20210121-152557490, title = "2020 59th IEEE Conference on Decision and Control (CDC)", chapter = "The Minimal Directed Information Needed to Improve the LQG Cost", year = "2020", url = "https://resolver.caltech.edu/CaltechAUTHORS:20210121-152557490", id = "record", isbn = "9781728174471", doi = "10.1109/cdc42340.2020.9304490" } @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", year = "2020", 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:20200831-150243516, title = "2020 IEEE International Symposium on Information Theory (ISIT)", chapter = "Stabilizing Dynamical Systems with Fixed-Rate Feedback using Constrained Quantizers", year = "2020", url = "https://resolver.caltech.edu/CaltechAUTHORS:20200831-150243516", id = "record", isbn = "9781728164328", doi = "10.1109/isit44484.2020.9173929" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20191213-102421150, title = "2020 IEEE International Symposium on Information Theory (ISIT)", chapter = "Fundamental limits of distributed tracking", year = "2020", url = "https://resolver.caltech.edu/CaltechAUTHORS:20191213-102421150", id = "record", isbn = "978-1-7281-6432-8", doi = "10.1109/ISIT44484.2020.9174006" } @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", year = "2020", url = "https://resolver.caltech.edu/CaltechAUTHORS:20200214-105613893", id = "record", isbn = "978-1-7281-6432-8", doi = "10.1109/ISIT44484.2020.9174026" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200214-105617315, title = "2020 IEEE International Symposium on Information Theory (ISIT)", chapter = "Optimal Causal Rate-Constrained Sampling for a Class of Continuous Markov Processes", year = "2020", url = "https://resolver.caltech.edu/CaltechAUTHORS:20200214-105617315", id = "record", isbn = "978-1-7281-6432-8", doi = "10.1109/ISIT44484.2020.9174333" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20190425-103602105, title = "Rate-Cost Tradeoffs in Control", journal = "IEEE Transactions on Automatic Control", year = "2019", url = "https://resolver.caltech.edu/CaltechAUTHORS:20190425-103602105", id = "record", issn = "0018-9286", doi = "10.1109/TAC.2019.2912256", volume = "64" } @other{https://resolver.caltech.edu/CaltechAUTHORS:20191004-141927403, title = "Stabilizing a system with an unbounded random gain using only a finite number of bits", year = "2019", url = "https://resolver.caltech.edu/CaltechAUTHORS:20191004-141927403", id = "record", doi = "10.48550/arXiv.1805.05535" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20190613-142206819, title = "Successive Refinement of Abstract Sources", journal = "IEEE Transactions on Information Theory", year = "2019", url = "https://resolver.caltech.edu/CaltechAUTHORS:20190613-142206819", id = "record", issn = "0018-9448", doi = "10.1109/tit.2019.2921829", volume = "65" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20190610-093125985, title = "The Dispersion of the Gauss-Markov Source", journal = "IEEE Transactions on Information Theory", year = "2019", url = "https://resolver.caltech.edu/CaltechAUTHORS:20190610-093125985", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2019.2919718", volume = "65" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20190425-110709737, title = "Control over Gaussian Channels With and Without Source-Channel Separation", journal = "IEEE Transactions on Automatic Control", year = "2019", url = "https://resolver.caltech.edu/CaltechAUTHORS:20190425-110709737", id = "record", issn = "0018-9286", doi = "10.1109/TAC.2019.2912255", volume = "64" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20191004-133629184, title = "2019 57th Annual Allerton Conference on Communication, Control, and Computing", chapter = "Optimal Causal Rate-Constrained Sampling of the Wiener Process", year = "2019", url = "https://resolver.caltech.edu/CaltechAUTHORS:20191004-133629184", id = "record", isbn = "978-1-7281-3151-1", doi = "10.1109/ALLERTON.2019.8919710" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200214-101154368, title = "2019 IEEE Information Theory Workshop (ITW)", chapter = "Rate loss in the Gaussian CEO problem", year = "2019", url = "https://resolver.caltech.edu/CaltechAUTHORS:20200214-101154368", id = "record", isbn = "978-1-5386-6900-6", doi = "10.1109/ITW44776.2019.8988944" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20191004-100332992, title = "2019 IEEE International Symposium on Information Theory (ISIT)", chapter = "From Parameter Estimation to Dispersion of Nonstationary Gauss-Markov Processes", year = "2019", url = "https://resolver.caltech.edu/CaltechAUTHORS:20191004-100332992", id = "record", isbn = "9781538692912", doi = "10.1109/isit.2019.8849797" } @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", year = "2019", 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-100333333, title = "2019 IEEE International Symposium on Information Theory (ISIT)", chapter = "Real-time Binary Posterior Matching", year = "2019", url = "https://resolver.caltech.edu/CaltechAUTHORS:20191004-100333333", id = "record", isbn = "9781538692912", doi = "10.1109/isit.2019.8849479" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20180629-113827049, title = "Tracking and Control of Gauss-Markov Processes over Packet-Drop Channels with Acknowledgments", journal = "IEEE Transactions on Control of Network Systems", year = "2019", url = "https://resolver.caltech.edu/CaltechAUTHORS:20180629-113827049", id = "record", issn = "2325-5870", doi = "10.1109/TCNS.2018.2850225", volume = "6" } @other{https://resolver.caltech.edu/CaltechAUTHORS:20190403-084738860, title = "Bit Error Rate is Convex at High SNR", year = "2019", url = "https://resolver.caltech.edu/CaltechAUTHORS:20190403-084738860", id = "record", doi = "10.48550/arXiv.0912.5043" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190204-124407625, title = "2018 IEEE Conference on Decision and Control (CDC)", chapter = "Exact minimum number of bits to stabilize a linear system", year = "2018", url = "https://resolver.caltech.edu/CaltechAUTHORS:20190204-124407625", id = "record", isbn = "978-1-5386-1395-5", doi = "10.1109/CDC.2018.8619156" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190329-091228468, title = "56th Annual Allerton Conference on Communication, Control, and Computing", chapter = "Rate-cost tradeoffs in scalar LQG control and tracking with side information", year = "2018", url = "https://resolver.caltech.edu/CaltechAUTHORS:20190329-091228468", id = "record", isbn = "978-1-5386-6596-1", doi = "10.1109/ALLERTON.2018.8635889" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190205-081829763, title = "2018 Annual American Control Conference (ACC)", chapter = "Fundamental limits and achievable performance in biomolecular control", year = "2018", url = "https://resolver.caltech.edu/CaltechAUTHORS:20190205-081829763", id = "record", isbn = "978-1-5386-5428-6", doi = "10.23919/ACC.2018.8430933" } @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", year = "2018", url = "https://resolver.caltech.edu/CaltechAUTHORS:20181126-150049870", id = "record", isbn = "978-1-5386-4780-6", doi = "10.1109/ISIT.2018.8437831" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20181126-145018270, title = "2018 IEEE International Symposium on Information Theory (ISIT)", chapter = "New Connections Between the Entropy Power Inequality and Geometric Inequalities", year = "2018", url = "https://resolver.caltech.edu/CaltechAUTHORS:20181126-145018270", id = "record", isbn = "978-1-5386-4780-6", doi = "10.1109/ISIT.2018.8437604" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20181126-141849980, title = "2018 IEEE International Symposium on Information Theory (ISIT)", chapter = "The Dispersion of the Gauss-Markov Source", year = "2018", url = "https://resolver.caltech.edu/CaltechAUTHORS:20181126-141849980", id = "record", isbn = "978-1-5386-4780-6", doi = "10.1109/ISIT.2018.8437463" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20181126-144509160, title = "2018 IEEE International Symposium on Information Theory (ISIT)", chapter = "Stabilizing a System with an Unbounded Random Gain Using Only Finitely Many Bits", year = "2018", url = "https://resolver.caltech.edu/CaltechAUTHORS:20181126-144509160", id = "record", isbn = "978-1-5386-4780-6", doi = "10.1109/ISIT.2018.8437548" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20180430-101112645, title = "A Lower Bound on the Differential Entropy of Log-Concave Random Vectors with Applications", journal = "Entropy", year = "2018", url = "https://resolver.caltech.edu/CaltechAUTHORS:20180430-101112645", id = "record", issn = "1099-4300", doi = "10.3390/e20030185", volume = "20", pmcid = "PMC7512702" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20180209-081746219, title = "2017 IEEE Information Theory Workshop (ITW)", chapter = "Sequential coding of Gauss-Markov sources with packet erasures and feedback", year = "2017", url = "https://resolver.caltech.edu/CaltechAUTHORS:20180209-081746219", id = "record", isbn = "978-1-5090-3098-9", doi = "10.1109/ITW.2017.8277955" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20170308-161418854, title = "Data Compression with Low Distortion and Finite Blocklength", journal = "IEEE Transactions on Information Theory", year = "2017", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170308-161418854", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2017.2676811", volume = "63" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20170524-171749779, title = "Joint Source-Channel Coding With Feedback", journal = "IEEE Transactions on Information Theory", year = "2017", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170524-171749779", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2017.2674667", volume = "63" } @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", year = "2017", 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-162727008, title = "2017 IEEE International Symposium on Information Theory (ISIT)", chapter = "A lower bound on the differential entropy for log-concave random variables with applications to rate-distortion theory", year = "2017", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170816-162727008", id = "record", isbn = "978-1-5090-4096-4", doi = "10.1109/ISIT.2017.8006487" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170816-161319771, title = "2017 IEEE International Symposium on Information Theory (ISIT)", chapter = "The rate-distortion function for successive refinement of abstract sources", year = "2017", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170816-161319771", id = "record", isbn = "978-1-5090-4096-4", doi = "10.1109/ISIT.2017.8006864" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170106-132902522, title = "IEEE 55th Conference on Decision and Control (CDC)", chapter = "Multi-rate control over AWGN channels via analog joint source-channel coding", year = "2016", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170106-132902522", id = "record", isbn = "978-1-5090-1837-6", doi = "10.1109/CDC.2016.7799185" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20160726-080006578, title = "Nonasymptotic noisy lossy source coding", journal = "IEEE Transactions on Information Theory", year = "2016", url = "https://resolver.caltech.edu/CaltechAUTHORS:20160726-080006578", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2016.2562008", volume = "62" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170221-071301966, title = "54th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2016", chapter = "When is Shannon's lower bound tight at finite blocklength?", year = "2016", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170221-071301966", id = "record", isbn = "978-1-5090-4551-8", doi = "10.1109/ALLERTON.2016.7852341" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170221-070702279, title = "54th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2016", chapter = "Rate-cost tradeoffs in control", year = "2016", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170221-070702279", id = "record", isbn = "978-1-5090-4551-8", doi = "10.1109/ALLERTON.2016.7852366" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170221-064842476, title = "54th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2016", chapter = "Rate-limited control of systems with uncertain gain", year = "2016", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170221-064842476", id = "record", isbn = "978-1-5090-4551-8", doi = "10.1109/ALLERTON.2016.7852370" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160412-084329467, chapter = "Data compression with low distortion and finite blocklength", year = "2015", url = "https://resolver.caltech.edu/CaltechAUTHORS:20160412-084329467", id = "record", doi = "10.1109/ALLERTON.2015.7447135" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20150729-151803634, title = "Variable-Length Compression Allowing Errors", journal = "IEEE Transactions on Information Theory", year = "2015", url = "https://resolver.caltech.edu/CaltechAUTHORS:20150729-151803634", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2015.2438831", volume = "61" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20151006-111737876, title = "2015 IEEE International Symposium on Information Theory", chapter = "Joint source-channel coding with feedback", year = "2015", url = "https://resolver.caltech.edu/CaltechAUTHORS:20151006-111737876", id = "record", isbn = "978-1-4673-7704-1", doi = "10.1109/ISIT.2015.7282460" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20150428-084727561, title = "Channels With Cost Constraints: Strong Converse and Dispersion", journal = "IEEE Transactions on Information Theory", year = "2015", url = "https://resolver.caltech.edu/CaltechAUTHORS:20150428-084727561", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2015.2409261", volume = "61" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20150630-073130634, title = "2015 IEEE Information Theory Workshop", chapter = "Transmitting k samples over the Gaussian channel: Energy-distortion tradeoff", year = "2015", url = "https://resolver.caltech.edu/CaltechAUTHORS:20150630-073130634", id = "record", isbn = "978-1-4799-5524-4", doi = "10.1109/ITW.2015.7133162" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161115-082050134, title = "2015 Information Theory and Applications Workshop (ITA)", chapter = "The output distribution of good lossy source codes", year = "2015", url = "https://resolver.caltech.edu/CaltechAUTHORS:20161115-082050134", id = "record", isbn = "978-1-4799-7195-4", doi = "10.1109/ITA.2015.7309005" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20150730-142923980, title = "2014 IEEE International Symposium on Information Theory (ISIT)", chapter = "Variable-Length Compression Allowing Errors", year = "2014", url = "https://resolver.caltech.edu/CaltechAUTHORS:20150730-142923980", id = "record", isbn = "9781479951864", doi = "10.1109/ISIT.2014.6875320" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20190213-084137169, title = "On Convexity of Error Rates in Digital Communications", journal = "IEEE Transactions on Information Theory", year = "2013", url = "https://resolver.caltech.edu/CaltechAUTHORS:20190213-084137169", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2013.2267772", volume = "59" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190213-075441906, title = "2013 IEEE International Symposium on Information Theory", chapter = "Convexity of error rates in digital communications under non-Gaussian noise", year = "2013", url = "https://resolver.caltech.edu/CaltechAUTHORS:20190213-075441906", id = "record", isbn = "978-1-4799-0446-4", doi = "10.1109/ISIT.2013.6620184" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20190213-090748243, title = "Lossy Joint Source-Channel Coding in the Finite Blocklength Regime", journal = "IEEE Transactions on Information Theory", year = "2013", url = "https://resolver.caltech.edu/CaltechAUTHORS:20190213-090748243", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2013.2238657", volume = "59" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140910-101108253, title = "2012 IEEE International Symposium on Information Theory Proceedings (ISIT)", chapter = "Lossy joint source-channel coding in the finite blocklength regime", year = "2012", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-101108253", id = "record", isbn = "978-1-4673-2580-6", doi = "10.1109/ISIT.2012.6283533" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20140910-113526494, title = "Fixed-Length Lossy Compression in the Finite Blocklength Regime", journal = "IEEE Transactions on Information Theory", year = "2012", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-113526494", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2012.2186786", volume = "58" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140910-102046386, chapter = "A new converse in rate-distortion theory", year = "2012", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-102046386", id = "record", doi = "10.1109/CISS.2012.6310949" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140910-112002771, title = "2011 IEEE Information Theory Workshop (ITW)", chapter = "Fixed-length lossy compression in the finite blocklength regime: Gaussian source", year = "2011", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-112002771", id = "record", isbn = "978-1-4577-0438-3", doi = "10.1109/ITW.2011.6089501" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20140910-105022320, title = "Optimum Power and Rate Allocation for Coded V-BLAST: Instantaneous Optimization", journal = "IEEE Transactions on Communications", year = "2011", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-105022320", id = "record", issn = "0090-6778", doi = "10.1109/TCOMM.2011.071111.100485", volume = "59" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140910-110253022, title = "IEEE International Symposium on Information Theory (ISIT), 2011", chapter = "Fixed-length lossy compression in the finite blocklength regime: discrete memoryless sources", year = "2011", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-110253022", id = "record", isbn = "978-1-4577-0596-0", doi = "10.1109/ISIT.2011.6034159" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140909-140645304, title = "2011 IEEE International Symposium on Information Theory Proceedings (ISIT)", chapter = "Performance analysis of coded V-BLAST with optimum power and rate allocation", year = "2011", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140909-140645304", id = "record", isbn = "978-1-4577-0596-0", doi = "10.1109/ISIT.2011.6033871" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140910-103127300, title = "IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)", chapter = "The value of redundant measurement in compressed sensing", year = "2011", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-103127300", id = "record", isbn = "978-1-4577-0538-0", doi = "10.1109/ICASSP.2011.5947143" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20140910-074750052, title = "Optimum Power and Rate Allocation for Coded V-BLAST: Average Optimization", journal = "IEEE Transactions on Communications", year = "2011", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-074750052", id = "record", issn = "0090-6778", doi = "10.1109/TCOMM.2011.010411.090561", volume = "59" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140910-094918979, title = "2010 IEEE International Symposium on Information Theory", chapter = "Error Rates of Capacity-Achieving Codes Are Convex", year = "2010", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-094918979", id = "record", isbn = "978-1-4244-7890-3", doi = "10.1109/ISIT.2010.5513337" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20140910-093556659, title = "Error Rates of the Maximum-Likelihood Detector for Arbitrary Constellations: Convex/Concave Behavior and Applications", journal = "IEEE Transactions on Information Theory", year = "2010", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-093556659", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2010.2040965", volume = "56" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140910-091940642, title = "IEEE International Conference on Communications (ICC 2009)", chapter = "Optimum Power and Rate Allocation for Coded V-BLAST", year = "2009", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-091940642", id = "record", isbn = "978-1-4244-3434-3", doi = "10.1109/ICC.2009.5199297" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20140909-152126131, title = "On Optimum Power Allocation for the V-BLAST", journal = "IEEE Transactions on Communications", year = "2008", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140909-152126131", id = "record", issn = "0090-6778", doi = "10.1109/TCOMM.2008.060517", volume = "56" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140910-070612419, title = "GLOBECOM 07", chapter = "Performance Analysis of V-BLAST with Optimum Power Allocation", year = "2007", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-070612419", id = "record", isbn = "978-1-4244-1042-2", doi = "10.1109/GLOCOM.2007.290" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140909-150741253, title = "IEEE International Symposium on Information Theory (ISIT), 2007", chapter = "Symbol Error Rates of Maximum-Likelihood Detector: Convex/Concave Behavior and Applications", year = "2007", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140909-150741253", id = "record", isbn = "978-1-4244-1397-3", doi = "10.1109/ISIT.2007.4557176" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140909-153041130, title = "23rd Biennial Symposium on Communications", chapter = "Transmit Power Allocation for the V-BLAST Algorithm", year = "2006", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140909-153041130", id = "record", isbn = "0-7803-9528-X", doi = "10.1109/BSC.2006.1644596" } @inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140909-154358392, title = "2006 International Zurich Seminar on Communications", chapter = "On Optimization of the V-BLAST Algorithm", year = "2006", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140909-154358392", id = "record", isbn = "1-4244-0092-9", doi = "10.1109/IZS.2006.1649092" }