<h1>Kostina, Victoria</h1>
<h2>Article from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2>
<ul>
<li>Yavas, Recep Can and Kostina, Victoria, el al. (2023) <a href="https://authors.library.caltech.edu/records/d2gvc-3yj77">Variable-Length Sparse Feedback Codes for Point-to-Point, Multiple Access, and Random Access Channels</a>; IEEE Transactions on Information Theory; <a href="https://doi.org/10.1109/tit.2023.3338632">10.1109/tit.2023.3338632</a></li>
<li>Guo, Nian and Kostina, Victoria (2023) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20230502-16744400.1">Reliability Function for Streaming Over a DMC With Feedback</a>; IEEE Transactions on Information Theory; Vol. 69; No. 4; 2165-2192; <a href="https://doi.org/10.1109/tit.2022.3225167">10.1109/tit.2022.3225167</a></li>
<li>Gündüz, Deniz and Kostina, Victoria, el al. (2023) <a href="https://authors.library.caltech.edu/records/3xata-0nk41">Guest Editorial Special Issue on the Role of Freshness and Semantic Measures in the Transmission of Information for Next-Generation Networks</a>; IEEE Journal on Selected Areas in Information Theory; Vol. 4; xvii-xix; <a href="https://doi.org/10.1109/jsait.2024.3352988">10.1109/jsait.2024.3352988</a></li>
<li>Lahouti, Farshad and Kostina, Victoria, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20221031-572094900.1">How to Query an Oracle? Efficient Strategies to Label Data</a>; IEEE Transactions on Pattern Analysis and Machine Intelligence; Vol. 44; No. 11; 7597-7609; <a href="https://doi.org/10.1109/tpami.2021.3118644">10.1109/tpami.2021.3118644</a></li>
<li>Kostina, Victoria and Peres, Yuval, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20211217-98215000">Exact minimum number of bits to stabilize a linear system</a>; IEEE Transactions on Automatic Control; Vol. 67; No. 10; 5548-5554; <a href="https://doi.org/10.1109/tac.2021.3126679">10.1109/tac.2021.3126679</a></li>
<li>Lin, Chung-Yi and Kostina, Victoria, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220909-232702000">Differentially Quantized Gradient Methods</a>; IEEE Transactions on Information Theory; Vol. 68; No. 9; 6078-6097; <a href="https://doi.org/10.1109/tit.2022.3171173">10.1109/tit.2022.3171173</a></li>
<li>Guo, Nian and Kostina, Victoria (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210412-071230573">Optimal Causal Rate-Constrained Sampling of the Wiener Process</a>; IEEE Transactions on Automatic Control; Vol. 67; No. 4; 1776-1791; <a href="https://doi.org/10.1109/tac.2021.3071953">10.1109/tac.2021.3071953</a></li>
<li>Guo, Nian and Kostina, Victoria (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20211222-322820000">Optimal Causal Rate-Constrained Sampling for a Class of Continuous Markov Processes</a>; IEEE Transactions on Information Theory; Vol. 67; No. 12; 7876-7890; <a href="https://doi.org/10.1109/tit.2021.3114142">10.1109/tit.2021.3114142</a></li>
<li>Kostina, Victoria and Hassibi, Babak (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20211222-495165300">The CEO Problem With Inter-Block Memory</a>; IEEE Transactions on Information Theory; Vol. 67; No. 12; 7752-7768; <a href="https://doi.org/10.1109/tit.2021.3111658">10.1109/tit.2021.3111658</a></li>
<li>Yavas, Recep Can and Kostina, Victoria, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20211122-171053652">Gaussian Multiple and Random Access Channels: Finite-Blocklength Analysis</a>; IEEE Transactions on Information Theory; Vol. 67; No. 11; 6983-7009; <a href="https://doi.org/10.1109/tit.2021.3111676">10.1109/tit.2021.3111676</a></li>
<li>Noorzad, Parham and Effros, Michelle, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210825-143502652">The Birthday Problem and Zero-Error List Codes</a>; IEEE Transactions on Information Theory; Vol. 67; No. 9; 5791-5803; <a href="https://doi.org/10.1109/tit.2021.3100806">10.1109/tit.2021.3100806</a></li>
<li>Tian, Peida and Kostina, Victoria (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210211-151615781">Nonstationary Gauss-Markov Processes: Parameter Estimation and Dispersion</a>; IEEE Transactions on Information Theory; Vol. 67; No. 4; 2426-2449; <a href="https://doi.org/10.1109/tit.2021.3050342">10.1109/tit.2021.3050342</a></li>
<li>Kostina, Victoria and Peres, Yuval, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210205-093044649">Stabilizing a System With an Unbounded Random Gain Using Only Finitely Many Bits</a>; IEEE Transactions on Information Theory; Vol. 67; No. 4; 2554-2561; <a href="https://doi.org/10.1109/tit.2021.3053140">10.1109/tit.2021.3053140</a></li>
<li>Yavas, Recep Can and Kostina, Victoria, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210113-163504947">Random Access Channel Coding in the Finite Blocklength Regime</a>; IEEE Transactions on Information Theory; Vol. 67; No. 4; 2115-2140; <a href="https://doi.org/10.1109/tit.2020.3047630">10.1109/tit.2020.3047630</a></li>
<li>Ebrahimi, MohammadReza and Lahouti, Farshad, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191004-135310393">Two-Layer Coded Channel Access With Collision Resolution: Design and Analysis</a>; IEEE Transactions on Wireless Communications; Vol. 19; No. 12; 7986-7997; <a href="https://doi.org/10.1109/TWC.2020.3018472">10.1109/TWC.2020.3018472</a></li>
<li>Chen, Shuqing and Effros, Michelle, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200723-131543186">Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access Scenarios</a>; IEEE Transactions on Information Theory; Vol. 66; No. 11; 6688-6722; <a href="https://doi.org/10.1109/tit.2020.3005155">10.1109/tit.2020.3005155</a></li>
<li>Kostina, Victoria and Hassibi, Babak (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190425-103602105">Rate-Cost Tradeoffs in Control</a>; IEEE Transactions on Automatic Control; Vol. 64; No. 11; 4525-4540; <a href="https://doi.org/10.1109/TAC.2019.2912256">10.1109/TAC.2019.2912256</a></li>
<li>Kostina, Victoria and Tuncel, Ertem (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190613-142206819">Successive Refinement of Abstract Sources</a>; IEEE Transactions on Information Theory; Vol. 65; No. 10; 6385-6398; <a href="https://doi.org/10.1109/tit.2019.2921829">10.1109/tit.2019.2921829</a></li>
<li>Tian, Peida and Kostina, Victoria (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190610-093125985">The Dispersion of the Gauss-Markov Source</a>; IEEE Transactions on Information Theory; Vol. 65; No. 10; 6355-6384; <a href="https://doi.org/10.1109/TIT.2019.2919718">10.1109/TIT.2019.2919718</a></li>
<li>Khina, Anatoly and Riedel Gårding, Elias, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190425-110709737">Control over Gaussian Channels With and Without Source-Channel Separation</a>; IEEE Transactions on Automatic Control; Vol. 64; No. 9; 3690-3705; <a href="https://doi.org/10.1109/TAC.2019.2912255">10.1109/TAC.2019.2912255</a></li>
<li>Khina, Anatoly and Kostina, Victoria, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180629-113827049">Tracking and Control of Gauss-Markov Processes over Packet-Drop Channels with Acknowledgments</a>; IEEE Transactions on Control of Network Systems; Vol. 6; No. 2; 549-560; <a href="https://doi.org/10.1109/TCNS.2018.2850225">10.1109/TCNS.2018.2850225</a></li>
<li>Marsiglietti, Arnaud and Kostina, Victoria (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180430-101112645">A Lower Bound on the Differential Entropy of Log-Concave Random Vectors with Applications</a>; Entropy; Vol. 20; No. 3; Art. No. 185; PMCID PMC7512702; <a href="https://doi.org/10.3390/e20030185">10.3390/e20030185</a></li>
<li>Kostina, Victoria (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170308-161418854">Data Compression with Low Distortion and Finite Blocklength</a>; IEEE Transactions on Information Theory; Vol. 63; No. 7; 4268-4285; <a href="https://doi.org/10.1109/TIT.2017.2676811">10.1109/TIT.2017.2676811</a></li>
<li>Kostina, Victoria and Polyanskiy, Yury, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170524-171749779">Joint Source-Channel Coding With Feedback</a>; IEEE Transactions on Information Theory; Vol. 63; No. 6; 3502-3515; <a href="https://doi.org/10.1109/TIT.2017.2674667">10.1109/TIT.2017.2674667</a></li>
<li>Kostina, Victoria and Verdú, Sergio (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160726-080006578">Nonasymptotic noisy lossy source coding</a>; IEEE Transactions on Information Theory; Vol. 62; No. 11; 6111-6123; <a href="https://doi.org/10.1109/TIT.2016.2562008">10.1109/TIT.2016.2562008</a></li>
<li>Kostina, Victoria and Polyanskiy, Yury, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150729-151803634">Variable-Length Compression Allowing Errors</a>; IEEE Transactions on Information Theory; Vol. 61; No. 8; 4316-4330; <a href="https://doi.org/10.1109/TIT.2015.2438831">10.1109/TIT.2015.2438831</a></li>
<li>Kostina, Victoria and Verdú, Sergio (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150428-084727561">Channels With Cost Constraints: Strong Converse and Dispersion</a>; IEEE Transactions on Information Theory; Vol. 61; No. 5; 2415-2429; <a href="https://doi.org/10.1109/TIT.2015.2409261">10.1109/TIT.2015.2409261</a></li>
<li>Loyka, Sergey and Kostina, Victoria, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190213-084137169">On Convexity of Error Rates in Digital Communications</a>; IEEE Transactions on Information Theory; Vol. 59; No. 10; 6501-6516; <a href="https://doi.org/10.1109/TIT.2013.2267772">10.1109/TIT.2013.2267772</a></li>
<li>Kostina, Victoria and Verdú, Sergio (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190213-090748243">Lossy Joint Source-Channel Coding in the Finite Blocklength Regime</a>; IEEE Transactions on Information Theory; Vol. 59; No. 5; 2545-2575; <a href="https://doi.org/10.1109/TIT.2013.2238657">10.1109/TIT.2013.2238657</a></li>
<li>Kostina, Victoria and Verdú, Sergio (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140910-113526494">Fixed-Length Lossy Compression in the Finite Blocklength Regime</a>; IEEE Transactions on Information Theory; Vol. 58; No. 6; 3309-3338; <a href="https://doi.org/10.1109/TIT.2012.2186786">10.1109/TIT.2012.2186786</a></li>
<li>Kostina, Victoria and Loyka, Sergey (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140910-105022320">Optimum Power and Rate Allocation for Coded V-BLAST: Instantaneous Optimization</a>; IEEE Transactions on Communications; Vol. 59; No. 10; 2841-2850; <a href="https://doi.org/10.1109/TCOMM.2011.071111.100485">10.1109/TCOMM.2011.071111.100485</a></li>
<li>Kostina, Victoria and Loyka, Sergey (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140910-074750052">Optimum Power and Rate Allocation for Coded V-BLAST: Average Optimization</a>; IEEE Transactions on Communications; Vol. 59; No. 3; 877-887; <a href="https://doi.org/10.1109/TCOMM.2011.010411.090561">10.1109/TCOMM.2011.010411.090561</a></li>
<li>Loyka, Sergey and Kostina, Victoria, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140910-093556659">Error Rates of the Maximum-Likelihood Detector for Arbitrary Constellations: Convex/Concave Behavior and Applications</a>; IEEE Transactions on Information Theory; Vol. 56; No. 4; 1948-1960; <a href="https://doi.org/10.1109/TIT.2010.2040965">10.1109/TIT.2010.2040965</a></li>
<li>Kostina, Victoria and Loyka, Sergey (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140909-152126131">On Optimum Power Allocation for the V-BLAST</a>; IEEE Transactions on Communications; Vol. 56; No. 6; 999-1012; <a href="https://doi.org/10.1109/TCOMM.2008.060517">10.1109/TCOMM.2008.060517</a></li>
</ul>