Journal: IEEE Transactions on Information Theory

Volume 64, Issue 5

3237 -- 3253Jayakrishnan Unnikrishnan, Saeid Haghighatshoar, Martin Vetterli. Unlabeled Sensing With Random Linear Measurements
3254 -- 3273Vince Lyzinski. Information Recovery in Shuffled Graphs via Graph Matching
3274 -- 3285Abhinav V. Sambasivan, Jarvis D. Haupt. Minimax Lower Bounds for Noisy Matrix Completion Under Sparse Factor Models
3286 -- 3300Ashwin Pananjady, Martin J. Wainwright, Thomas A. Courtade. Linear Regression With Shuffled Data: Statistical and Computational Limits of Permutation Recovery
3301 -- 3312Irène Waldspurger. Phase Retrieval With Random Gaussian Sensing Vectors by Alternating Projections
3313 -- 3330Weihao Gao, Sewoong Oh, Pramod Viswanath. Breaking the Bandwidth Barrier: Geometrical Adaptive Entropy Estimation
3331 -- 3345Dong Dai, Lei Han, Ting Yang, Tong Zhang. Bayesian Model Averaging With Exponentiated Least Squares Loss
3346 -- 3360Georgios Fellouris, Erhan Bayraktar, Lifeng Lai. Efficient Byzantine Sequential Change Detection
3361 -- 3370Alix Lheritier, Frédéric Cazals. A Sequential Non-Parametric Multivariate Two-Sample Test
3371 -- 3393Marco Mondelli, S. Hamed Hassani, Rüdiger L. Urbanke. How to Achieve the Capacity of Asymmetric Channels
3394 -- 3402Chaoping Xing, Chen Yuan. A New Class of Rank-Metric Codes and Their List Decoding Beyond the Unique Decoding Radius
3403 -- 3410Joshua Brakensiek, Venkatesan Guruswami, Samuel Zbarsky. Efficient Low-Redundancy Codes for Correcting Multiple Deletions
3411 -- 3430Yoones Hashemi, Amir H. Banihashemi. Characterization of Elementary Trapping Sets in Irregular LDPC Codes and the Corresponding Efficient Exhaustive Search Algorithms
3431 -- 3449Vahid Aref, Narayanan Rengaswamy, Laurent Schmalen. Finite-Length Analysis of Spatially-Coupled Regular LDPC Ensembles on Burst-Erasure Channels
3450 -- 3460Yujie Gu, Ying Miao. Bounds on Traceability Schemes
3461 -- 3480Ardhendu Tripathy, Aditya Ramamoorthy. Sum-Networks From Incidence Structures: Construction and Capacity Analysis
3481 -- 3492Abhishek Agarwal, Alexander Barg, Sihuang Hu, Arya Mazumdar, Itzhak Tamo. Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
3493 -- 3512Imad Ahmad, Chih-Chun Wang. Locally Repairable Regenerating Codes: Node Unavailability and the Insufficiency of Stationary Local Repair
3513 -- 3527Wentu Song, Kai Cai, Chau Yuen, Kui Cai, Guangyue Han. On Sequential Locally Repairable Codes
3528 -- 3537Claudio Qureshi, Sueli I. R. Costa, Christiane B. Rodrigues, Marcelo Firer. On Equivalence of Binary Asymmetric Channels Regarding the Maximum Likelihood Decoding
3538 -- 3578Annina Bracher, Amos Lapidoth. The Zero-Error Feedback Capacity of State-Dependent Channels
3579 -- 3589Ashok Vardhan Makkuva, Yihong Wu 0001. Equivalence of Additive-Combinatorial Linear Inequalities for Shannon Entropy and Differential Entropy
3590 -- 3609Elon Lindenstrauss, Masaki Tsukamoto. From Rate Distortion Theory to Metric Mean Dimension: Variational Principle
3610 -- 3615Tarik Kaced, Andrei E. Romashchenko, Nikolai K. Vereshchagin. A Conditional Information Inequality and Its Combinatorial Applications
3616 -- 3632Lei Yu 0003, Vincent Y. F. Tan. Wyner's Common Information Under Rényi Divergence Measures
3633 -- 3654Benjamin Larrousse, Samson Lasaulce, Matthieu R. Bloch. Coordination in Distributed Networks via Coded Actions With Application to Power Control
3655 -- 3678Parham Noorzad, Michelle Effros, Michael Langberg. The Unbounded Benefit of Encoder Cooperation for the $k$ -User MAC
3679 -- 3695Simon Li, Ashish Khisti, Aditya Mahajan. Information-Theoretic Privacy for Smart Metering Systems with a Rechargeable Battery
3696 -- 3714Wenwen Tu, Lifeng Lai. Keyless Authentication and Authenticated Capacity
3715 -- 3733Semih Yagli, Yucel Altug, Sergio Verdú. Minimax Rényi Redundancy
3734 -- 3755Vincent Y. F. Tan, Masahito Hayashi. Analysis of Remaining Uncertainties and Exponents Under Various Conditional Rényi Entropies
3756 -- 3780Lin Zhou 0002, Vincent Y. F. Tan, Mehul Motani. Achievable Moderate Deviations Asymptotics for Streaming Compression of Correlated Sources
3781 -- 3809Farhad Shirani Chaharsooghi, S. Sandeep Pradhan. An Achievable Rate-Distortion Region for Multiple Descriptions Source Coding Based on Coset Codes
3810 -- 3824Alon Kipnis, Andrea J. Goldsmith, Yonina C. Eldar. The Distortion Rate Function of Cyclostationary Gaussian Processes
3825 -- 3841Burak Çakmak, Ralf R. Müller, Bernard H. Fleury. Capacity Scaling in MIMO Systems With General Unitarily Invariant Random Matrices
3842 -- 3864Xinping Yi, Giuseppe Caire. Topological Interference Management With Decoded Message Passing
3865 -- 3882Sudeep Kamath, Venkatachalam Anantharam, David Tse, Chih-Chun Wang. The Two-Unicast Problem
3883 -- 3893Weiping Zhu. Statistical Properties of Loss Rate Estimators in Tree Topology
3894 -- 3915Mauro Barni, Benedetta Tondi. Adversarial Source Identification Game With Corrupted Training
3916 -- 3926Cheuk Ting Li, Abbas El Gamal. Maximal Correlation Secrecy
3927 -- 3943Carlos Aguilar Melchor, Olivier Blazy, Jean-Christophe Deneuville, Philippe Gaborit, Gilles Zémor. Efficient Encryption From Random Quasi-Cyclic Codes
3944 -- 3952Yupeng Jiang, Dongdai Lin. Lower and Upper Bounds on the Density of Irreducible NFSRs
3953 -- 0S. Sandeep Pradhan, Mohsen Heidari, Aria Ghasemian Sahebi. Corrections to "Abelian Group Codes for Channel Coding and Source Coding"