@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" } @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", 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", url = "https://authors.library.caltech.edu/records/3xata-0nk41", id = "record", issn = "2641-8770", doi = "10.1109/jsait.2024.3352988", volume = "4" } @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", 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", 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", url = "https://resolver.caltech.edu/CaltechAUTHORS:20220909-232702000", id = "record", issn = "0018-9448", doi = "10.1109/tit.2022.3171173", volume = "68" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20210412-071230573, title = "Optimal Causal Rate-Constrained Sampling of the Wiener Process", journal = "IEEE Transactions on Automatic Control", url = "https://resolver.caltech.edu/CaltechAUTHORS:20210412-071230573", id = "record", issn = "0018-9286", doi = "10.1109/tac.2021.3071953", volume = "67" } @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", 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", 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", url = "https://resolver.caltech.edu/CaltechAUTHORS:20211122-171053652", id = "record", issn = "0018-9448", doi = "10.1109/tit.2021.3111676", volume = "67" } @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: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:20210205-093044649, title = "Stabilizing a System With an Unbounded Random Gain Using Only Finitely Many Bits", journal = "IEEE Transactions on Information Theory", 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", 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", url = "https://resolver.caltech.edu/CaltechAUTHORS:20191004-135310393", id = "record", issn = "1536-1276", doi = "10.1109/TWC.2020.3018472", volume = "19" } @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" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20190425-103602105, title = "Rate-Cost Tradeoffs in Control", journal = "IEEE Transactions on Automatic Control", url = "https://resolver.caltech.edu/CaltechAUTHORS:20190425-103602105", id = "record", issn = "0018-9286", doi = "10.1109/TAC.2019.2912256", volume = "64" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20190610-093125985, title = "The Dispersion of the Gauss-Markov Source", journal = "IEEE Transactions on Information Theory", 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:20190613-142206819, title = "Successive Refinement of Abstract Sources", journal = "IEEE Transactions on Information Theory", 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:20190425-110709737, title = "Control over Gaussian Channels With and Without Source-Channel Separation", journal = "IEEE Transactions on Automatic Control", url = "https://resolver.caltech.edu/CaltechAUTHORS:20190425-110709737", id = "record", issn = "0018-9286", doi = "10.1109/TAC.2019.2912255", volume = "64" } @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", url = "https://resolver.caltech.edu/CaltechAUTHORS:20180629-113827049", id = "record", issn = "2325-5870", doi = "10.1109/TCNS.2018.2850225", volume = "6" } @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", url = "https://resolver.caltech.edu/CaltechAUTHORS:20180430-101112645", id = "record", issn = "1099-4300", doi = "10.3390/e20030185", volume = "20", pmcid = "PMC7512702" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20170308-161418854, title = "Data Compression with Low Distortion and Finite Blocklength", journal = "IEEE Transactions on Information Theory", 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", url = "https://resolver.caltech.edu/CaltechAUTHORS:20170524-171749779", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2017.2674667", volume = "63" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20160726-080006578, title = "Nonasymptotic noisy lossy source coding", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20160726-080006578", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2016.2562008", volume = "62" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20150729-151803634, title = "Variable-Length Compression Allowing Errors", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20150729-151803634", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2015.2438831", volume = "61" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20150428-084727561, title = "Channels With Cost Constraints: Strong Converse and Dispersion", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20150428-084727561", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2015.2409261", volume = "61" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20190213-084137169, title = "On Convexity of Error Rates in Digital Communications", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20190213-084137169", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2013.2267772", volume = "59" } @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", url = "https://resolver.caltech.edu/CaltechAUTHORS:20190213-090748243", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2013.2238657", volume = "59" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20140910-113526494, title = "Fixed-Length Lossy Compression in the Finite Blocklength Regime", journal = "IEEE Transactions on Information Theory", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-113526494", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2012.2186786", volume = "58" } @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", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-105022320", id = "record", issn = "0090-6778", doi = "10.1109/TCOMM.2011.071111.100485", volume = "59" } @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", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-074750052", id = "record", issn = "0090-6778", doi = "10.1109/TCOMM.2011.010411.090561", volume = "59" } @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", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140910-093556659", id = "record", issn = "0018-9448", doi = "10.1109/TIT.2010.2040965", volume = "56" } @article{https://resolver.caltech.edu/CaltechAUTHORS:20140909-152126131, title = "On Optimum Power Allocation for the V-BLAST", journal = "IEEE Transactions on Communications", url = "https://resolver.caltech.edu/CaltechAUTHORS:20140909-152126131", id = "record", issn = "0090-6778", doi = "10.1109/TCOMM.2008.060517", volume = "56" }