Journal: IEEE Transactions on Information Theory

Volume 64, Issue 10

6461 -- 6483Ohad Elishco, Tom Meyerovitch, Moshe Schwartz 0001. On Independence and Capacity of Multidimensional Semiconstrained Systems
6484 -- 6497José Joaquín Bernal, Juan Jacobo Simón Pinero. Information Sets From Defining Sets for Reed-Muller Codes of First and Second Order
6498 -- 6505Gaojun Luo, Xiwang Cao. Two Constructions of Asymptotically Optimal Codebooks via the Hyper Eisenstein Sum
6506 -- 6525Ankit Singh Rawat, Itzhak Tamo, Venkatesan Guruswami, Klim Efremenko. MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth
6526 -- 6535Ian F. Blake, Shu Lin. On Short Cycle Enumeration in Biregular Bipartite Graphs
6536 -- 6545Cunsheng Ding, Ziling Heng, Zhengchun Zhou. Minimal Binary Linear Codes
6546 -- 6560Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson. Explicit Capacity Approaching Coding for Interactive Communication
6561 -- 6566Tao Zhang 0030, Gennian Ge. On the Nonexistence of Perfect Splitter Sets
6567 -- 6582Hoang Dau, Iwan M. Duursma, Han Mao Kiah, Olgica Milenkovic. Repairing Reed-Solomon Codes With Multiple Erasures
6583 -- 6589Claude Carlet, Cem Güneri, Ferruh Özbudak, Buket Özkaya, Patrick Solé. On Linear Complementary Pairs of Codes
6590 -- 6603Tsung-Ching Lin, Chong-Dao Lee, Trieu-Kien Truong, Yaotsu Chang. The Use of Multivariate Weak-Locator Polynomials to Decode Cyclic Codes up to Actual Minimum Distance
6604 -- 6619Anshoo Tandon, Han Mao Kiah, Mehul Motani. Bounds on the Size and Asymptotic Rate of Subblock-Constrained Codes
6620 -- 6637François Bachoc, Fabrice Gamboa, Jean-Michel Loubes, Nil Venet. A Gaussian Process Regression Model for Distribution Inputs
6638 -- 6661Simone Brugiapaglia, Ben Adcock. Robustness to Unknown Error in Sparse Regularization
6662 -- 6671Jiantao Jiao, Kartik Venkat, Tsachy Weissman. Mutual Information, Relative Entropy and Estimation Error in Semi-Martingale Channels
6672 -- 6706Jiantao Jiao, Yanjun Han, Tsachy Weissman. 1 Distance
6707 -- 6721Mohammad Golbabaee, Mike E. Davies. Inexact Gradient Projection and Fast Data Driven Compressed Sensing
6722 -- 6730Juan Miguel Medina, Bruno Cernuschi-Frías. On the Papoulis Sampling Theorem: Some General Conditions
6731 -- 6742Junfeng Wu, Guodong Shi, Brian D. O. Anderson, Karl Henrik Johansson. Kalman Filtering Over Fading Channels: Zero-One Laws and Almost Sure Stabilities
6743 -- 6758Irene Valero Toranzo, Steeve Zozor, Jean-Marc Brossier. Generalization of the de Bruijn Identity to General φ-Entropies and φ-Fisher Informations
6759 -- 6770Rajai Nasser. Characterizations of Two Channel Orderings: Input-Degradedness and the Shannon Ordering
6771 -- 6778Qi Cao, Ning Cai 0001, Wangmei Guo, Raymond W. Yeung. On Zero-Error Capacity of Binary Channels With One Memory
6779 -- 6802Si-Hyeon Lee, Sae-Young Chung. A Unified Random Coding Bound
6803 -- 6815Krzysztof Postek, Aharon Ben-Tal. Computing the Channel Capacity of a Communication System Affected by Uncertain Transition Probabilities
6816 -- 6829Christoph Kawan, Serdar Yüksel. On Optimal Coding of Non-Linear Dynamical Systems
6830 -- 6841Ehsan Shafieepoorfard, Maxim Raginsky. Sequential Empirical Coordination Under an Output Entropy Constraint
6842 -- 6862Karim A. Banawan, Sennur Ulukus. Multi-Message Private Information Retrieval: Capacity Results and Near-Optimal Schemes
6863 -- 6877Yu-Chih Huang, Krishna R. Narayanan, Ping-Chung Wang. Lattices Over Algebraic Integers With an Application to Compute-and-Forward
6878 -- 6893Morteza Soltani, Zouheir Rezki. Optical Wiretap Channel With Input-Dependent Gaussian Noise Under Peak- and Average-Intensity Constraints
6894 -- 6916Jinyuan Chen. On the MISO Channel With Feedback: Can Infinitely Massive Antennas Achieve Infinite Capacity?
6917 -- 6928Rupert H. Levene, Vern I. Paulsen, Ivan G. Todorov. Complexity and Capacity Bounds for Quantum Channels
6929 -- 6938Eric A. Carlen, Anna Vershynina. Recovery and the Data Processing Inequality for Quasi-Entropies