default search action
IEEE Transactions on Information Theory, Volume 67
Volume 67, Number 1, January 2021
- Yuval Cassuto, Jacob Ziv:
Efficient Compression of Long Arbitrary Sequences With No Reference at the Encoder. 1-9 - David Sutter, Omar Fawzi, Renato Renner:
Bounds on Lyapunov Exponents via Entropy Accumulation. 10-24 - Anoosheh Heidarzadeh, Fatemeh Kazemi, Alex Sprintson:
The Role of Coded Side Information in Single-Server Private Information Retrieval. 25-44 - James Melbourne, Tomasz Tkocz:
Reversal of Rényi Entropy Inequalities Under Log-Concavity. 45-51 - Moritz Wiese, Holger Boche:
Semantic Security via Seeded Modular Coding Schemes and Ramanujan Graphs. 52-80 - Mokshay Madiman, Piotr Nayar, Tomasz Tkocz:
Sharp Moment-Entropy Inequalities and Capacity Bounds for Symmetric Log-Concave Distributions. 81-94 - Jian Lu, Yinfei Xu, Ping Zhang, Qiao Wang:
On Secure One-Helper Source Coding With Action-Dependent Side Information. 95-110 - Julien Lavauzelle, Jade Nardi:
Weighted Lifted Codes: Local Correctabilities and Application to Robust Private Information Retrieval. 111-123 - Fei Li:
Weight Hierarchies of a Class of Linear Codes Related to Non-Degenerate Quadratic Forms. 124-129 - Xiaolei Fang, Meiqing Liu, Jinquan Luo:
New MDS Euclidean Self-Orthogonal Codes. 130-137 - Hassan Khodaiemehr, Daniel Panario, Mohammad-Reza Sadeghi:
Design and Practical Decoding of Full-Diversity Construction A Lattices for Block-Fading Channels. 138-163 - Mahdi Soleymani, Hessam Mahdavifar:
Distributed Multi-User Secret Sharing. 164-178 - Romar dela Cruz, Alfred Wassermann:
Majority Logic Decoding With Subspace Designs. 179-186 - Han Mao Kiah, Anshoo Tandon, Mehul Motani:
Generalized Sphere-Packing Bound for Subblock-Constrained Codes. 187-199 - Jinping Fan, Yujie Gu, Masahiro Hachimori, Ying Miao:
Signature Codes for Weighted Binary Adder Channel and Multimedia Fingerprinting. 200-216 - Bin Chen, Weijun Fang, Shu-Tao Xia, Jie Hao, Fang-Wei Fu:
Improved Bounds and Singleton-Optimal Constructions of Locally Repairable Codes With Minimum Distance 5 and 6. 217-231 - Erich L. Kaltofen, Zhi-Hong Yang:
Sparse Interpolation With Errors in Chebyshev Basis Beyond Redundant-Block Decoding. 232-243 - Chunming Tang, Cunsheng Ding:
An Infinite Family of Linear Codes Supporting 4-Designs. 244-254 - Yeow Meng Chee, Han Mao Kiah, Hui Zhang:
Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes Using Linear Programming. 255-267 - José Joaquín Bernal-Buitrago, Juan Jacobo Simón Pinero:
A New Approach to the Berlekamp-Massey-Sakata Algorithm: Improving Locator Decoding. 268-281 - Ahmed H. Hareedy, Beyza Dabak, A. Robert Calderbank:
Managing Device Lifecycle: Reconfigurable Constrained Codes for M/T/Q/P-LC Flash Memories. 282-295 - Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas:
On List Recovery of High-Rate Tensor Codes. 296-316 - Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jez, Markus Lohrey, Carl Philipp Reh:
The Smallest Grammar Problem Revisited. 317-328 - Ohad Elishco, Alexander Barg:
Capacity of Dynamical Storage Systems. 329-346 - Xujun Liu, Roberto Assis Machado, Olgica Milenkovic:
Directed Intersection Representations and the Information Content of Digraphs. 347-357 - Kai Wan, Giuseppe Caire:
On Coded Caching With Private Demands. 358-372 - Jin Xu, Natarajan Gautam:
Peak Age of Information in Priority Queuing Systems. 373-390 - Miodrag Zivkovic, Marko Caric:
On the Number of Equivalence Classes of Boolean and Invertible Boolean Functions. 391-407 - Yannis Bousba, Travis Russell:
No Quantum Ramsey Theorem for Stabilizer Codes. 408-415 - Yinan Li, Jeroen Zuiddam:
Quantum Asymptotic Spectra of Graphs and Non-Commutative Graphs, and Quantum Shannon Capacities. 416-432 - Eyuri Wakakuwa:
Communication Cost for Non-Markovianity of Tripartite Quantum States: A Resource Theoretic Approach. 433-451 - Seunghoan Song, Masahito Hayashi:
Capacity of Quantum Private Information Retrieval With Multiple Servers. 452-463 - Octavio César Mesner, Cosma Rohilla Shalizi:
Conditional Mutual Information Estimation for Mixed, Discrete and Continuous Data. 464-484 - Cheng-Der Fuh:
Asymptotically Optimal Change Point Detection for Composite Hypothesis in State Space Models. 485-505 - Zhiqi Bu, Jason M. Klusowski, Cynthia Rush, Weijie J. Su:
Algorithmic Analysis and Statistical Estimation of SLOPE via Approximate Message Passing. 506-537 - Gökhan Gül:
Minimax Robust Decentralized Hypothesis Testing for Parallel Sensor Networks. 538-548 - F. Richard Guo, Thomas S. Richardson:
Chernoff-Type Concentration of Empirical Probabilities in Relative Entropy. 549-558 - Erhan Bayraktar, H. Vincent Poor, Xin Zhang:
Malicious Experts Versus the Multiplicative Weights Algorithm in Online Prediction. 559-565 - Ashwin Pananjady, Martin J. Wainwright:
Instance-Dependent ℓ∞-Bounds for Policy Evaluation in Tabular Reinforcement Learning. 566-585 - Ferdinando Cicalese, Eduardo Sany Laber:
Information Theoretical Clustering Is Hard to Approximate. 586-597 - Varun S. Jog, Po-Ling Loh:
Teaching and Learning in Uncertainty. 598-615 - Deming Yuan, Alexandre Proutière, Guodong Shi:
Distributed Online Linear Regressions. 616-639 - Xiucai Ding, Hau-Tieng Wu:
On the Spectral Property of Kernel-Based Sensor Fusion Algorithms of High Dimensional Data. 640-670
Volume 67, Number 2, February 2021
- Barak Beilin, David Burshtein:
On Polar Coding for Side Information Channels. 673-685 - Han Cai, Moshe Schwartz:
On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes. 686-704 - Daniel Heinlein:
Generalized Linkage Construction for Constant-Dimension Codes. 705-715 - Ray Li, Mary Wootters:
Lifted Multiplicity Codes and the Disjoint Repair Group Property. 716-725 - Shahrzad Kiani, Nuwan S. Ferdinand, Stark C. Draper:
Hierarchical Coded Matrix Multiplication. 726-754 - Zitan Chen, Alexander Barg:
Cyclic and Convolutional Codes With Locality. 755-769 - Lingfei Jin, Liming Ma, Chaoping Xing:
A New Construction of Nonlinear Codes via Rational Function Fields. 770-777 - Jiange Li, Muriel Médard:
Boolean Functions: Noise Stability, Non-Interactive Correlation Distillation, and Mutual Information. 778-789 - Behrooz Tahmasebi, Mohammad Ali Maddah-Ali, Seyed Abolfazl Motahari:
The Capacity of Associated Subsequence Retrieval. 790-804 - Maël Le Treust, Matthieu R. Bloch:
State Leakage and Coordination With Causal State Knowledge at the Encoder. 805-823 - Yanina Y. Shkel, Rick S. Blum, H. Vincent Poor:
Secrecy by Design With Applications to Privacy and Compression. 824-843 - Yücel Altug, Aaron B. Wagner:
On Exact Asymptotics of the Error Probability in Channel Coding: Symmetric Channels. 844-868 - Jingbo Liu:
Dispersion Bound for the Wyner-Ahlswede-Körner Network via a Semigroup Method on Types. 869-885 - Tomer Berg, Ofer Shayevitz, Young-Han Kim, Lele Wang:
Distributed Source Simulation With No Communication. 886-901 - Hao-Chung Cheng, Eric P. Hanson, Nilanjana Datta, Min-Hsiu Hsieh:
Non-Asymptotic Classical Data Compression With Quantum Side Information. 902-930 - Arun B. Aloshious, Pradeep Kiran Sarvepalli:
Decoding Toric Codes on Three Dimensional Simplical Complexes. 931-945 - Navneeth Ramakrishnan, Raban Iten, Volkher B. Scholz, Mario Berta:
Computing Quantum Channel Capacities. 946-960 - Yahya H. Ezzeldin, Martina Cardone, Christina Fragouli, Giuseppe Caire:
Gaussian 1-2-1 Networks: Capacity Results for mmWave Communications. 961-990 - Siu-Wai Ho:
The Interplay Between Block Design Theory and Channel Estimation in Visible Light System. 991-1007 - Alexandr A. Polujan, Alexander Pott:
On Design-Theoretic Aspects of Boolean and Vectorial Bent Function. 1027-1037 - Samir Hodzic, Peter Horák, Enes Pasalic:
Characterization of Basic 5-Value Spectrum Functions Through Walsh-Hadamard Transform. 1038-1053 - Zhengbin Liu, Yongqiang Li, Lin Jiao, Mingsheng Wang:
A New Method for Searching Optimal Differential and Linear Trails in ARX Ciphers. 1054-1068 - Farzan Haddadi, Arash Amini:
Eigenvectors of Deformed Wigner Random Matrices. 1069-1079 - Chin Hei Chan, Vahid Tarokh, Maosheng Xiong:
Convergence Rate of Empirical Spectral Distribution of Random Matrices From Linear Codes. 1080-1087 - Michiko Okudo, Fumiyasu Komaki:
Bayes Extended Estimators for Curved Exponential Families. 1088-1098 - Chao Wang, Kobi Cohen, Qing Zhao:
Information-Directed Random Walk for Rare Event Detection in Hierarchical Processes. 1099-1116 - Deepesh Data, Linqi Song, Suhas N. Diggavi:
Data Encoding for Byzantine-Resilient Distributed Optimization. 1117-1140 - Arya Mazumdar, Soumyabrata Pal:
Semisupervised Clustering by Queries and Locally Encodable Source Coding. 1141-1155 - Benjamin Aubin, Bruno Loureiro, Antoine Maillard, Florent Krzakala, Lenka Zdeborová:
The Spiked Matrix Model With Generative Priors. 1156-1181 - Di Wang, Jinhui Xu:
On Sparse Linear Regression in the Local Differential Privacy Model. 1182-1200 - Eduardo Pavez, Antonio Ortega:
Covariance Matrix Estimation With Non Uniform and Data Dependent Missing Observations. 1201-1215 - Jwo-Yuh Wu, Liang-Chi Huang, Ming-Hsun Yang, Chun-Hung Liu:
Sparse Subspace Clustering via Two-Step Reweighted L1-Minimization: Algorithm and Provable Neighbor Recovery Rates. 1216-1263 - Simon Foucart, Deanna Needell, Reese Pathak, Yaniv Plan, Mary Wootters:
Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns. 1264-1290 - Wolfgang Erb:
Shapes of Uncertainty in Spectral Graph Theory. 1291-1307 - Zhihui Zhu, Qiuwei Li, Gongguo Tang, Michael B. Wakin:
The Global Optimization Geometry of Low-Rank Matrix Optimization. 1308-1331 - Junjie Ma, Rishabh Dudeja, Ji Xu, Arian Maleki, Xiaodong Wang:
Spectral Method for Phase Retrieval: An Expectation Propagation Perspective. 1332-1355 - Dong Xia, Ming Yuan:
Effective Tensor Sketching via Sparsification. 1356-1369
Volume 67, Number 3, March 2021
- Ziv Goldfeld, Guy Bresler, Yury Polyanskiy:
Information Storage in the Stochastic Ising Model. 1373-1399 - Minh Thanh Vu, Tobias J. Oechtering, Mikael Skoglund, Holger Boche:
Uncertainty in Identification Systems. 1400-1414 - Kaiming Shen, Reza Khosravi-Farsani, Wei Yu:
Capacity Limits of Full-Duplex Cellular Network. 1415-1432 - Sreejith Sreekumar, Alexander Bunin, Ziv Goldfeld, Haim H. Permuter, Shlomo Shamai:
The Secrecy Capacity of Cost-Constrained Wiretap Channels. 1433-1445 - Susanna E. Rumsey, Stark C. Draper, Frank R. Kschischang:
Information Density in Multi-Layer Resistive Memories. 1446-1460 - Alexandra M. Porter, Mary Wootters:
Embedded Index Coding. 1461-1477 - Hsin-Po Wang, Iwan M. Duursma:
Polar Codes' Simplicity, Random Codes' Durability. 1478-1508 - Hsin-Po Wang, Iwan M. Duursma:
Log-Logarithmic Time Pruned Polar Coding. 1509-1521 - Ray Li, Mary Wootters:
Improved List-Decodability of Random Linear Binary Codes. 1522-1536 - Francisco Lázaro, Gianluigi Liva, Gerhard Bauch, Enrico Paolini:
Bounds on the Error Probability of Raptor Codes Under Maximum Likelihood Decoding. 1537-1558 - Steffen Bondorf, Binbin Chen, Jonathan Scarlett, Haifeng Yu, Yuda Zhao:
Sublinear-Time Non-Adaptive Group Testing With O(k log n) Tests via Bit-Mixing Coding. 1559-1570 - Lukas Holzbaur, Sven Puchinger, Antonia Wachter-Zeh:
Error Decoding of Locally Repairable and Partial MDS Codes. 1571-1595 - Jing Qiu, Dabin Zheng, Fang-Wei Fu:
New Constructions of Optimal Cyclic (r, δ) Locally Repairable Codes From Their Zeros. 1596-1608 - Ron M. Roth, Paul H. Siegel:
On Bi-Modal Constrained Coding. 1609-1621 - Irrinki Gnana Sudha, R. S. Selvaraj:
MDS and I-Perfect Codes in Pomset Metric. 1622-1629 - Wenjun Yu, Xiande Zhang, Gennian Ge:
Optimal Fraction Repetition Codes for Access-Balancing in Distributed Storage. 1630-1640 - Peter Beelen, Johan Rosenkilde, Grigory Solomatov:
Fast Encoding of AG Codes Over Cab Curves. 1641-1655 - Matthew Fickus, Benjamin R. Mayo:
Mutually Unbiased Equiangular Tight Frames. 1656-1667 - Milán Mosonyi, Tomohiro Ogawa:
Divergence Radii and the Strong Converse Exponent of Classical-Quantum Channel Coding With Constant Compositions. 1668-1698 - Ali Haghi, Amir K. Khandani:
Rate Splitting and Successive Decoding for Gaussian Interference Channels. 1699-1731 - Minquan Cheng, Jie Li, Xiaohu Tang, Ruizhong Wei:
Linear Coded Caching Scheme for Centralized Networks. 1732-1742 - Rajat Talak, Eytan H. Modiano:
Age-Delay Tradeoffs in Queueing Systems. 1743-1758 - Thomas Stahlbuhk, Brooke Shrader, Eytan H. Modiano:
Learning Algorithms for Minimizing Queue Length Regret. 1759-1781 - Alessio Sancetta:
Estimation in Reproducing Kernel Hilbert Spaces With Dependent Data. 1782-1795 - Jie Chen, Wenyi Zhang, H. Vincent Poor:
A Bayesian Approach to Sequential Change Detection and Isolation Problems. 1796-1803 - Jiangfan Zhang, Xiaodong Wang:
Low-Complexity Quickest Change Detection in Linear Systems With Unknown Time-Varying Pre- and Post-Change Distributions. 1804-1824 - Vladislav Z. B. Tadic, Arnaud Doucet:
Asymptotic Properties of Recursive Particle Maximum Likelihood Estimation. 1825-1848 - Yiran Shi, Dingli Yu, Hongyan Shi, Yaowu Shi:
A New Concept of Fractional Order Cumulant and It-Based Signal Processing in α and/or Gaussian Noise. 1849-1863 - Jiangfan Zhang, Xiaodong Wang:
Consensus-Based Distributed Quickest Detection of Attacks With Unknown Parameters. 1864-1885 - Aleksandr Y. Aravkin, James V. Burke, Daiwei He:
On the Global Minimizers of Real Robust Phase Retrieval With Sparse Noise. 1886-1896 - Elad Romanov, Or Ordentlich:
Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs From LSBs. 1897-1919 - (Withdrawn) A Novel Representation for Permutations. 1920-1927
- Yuanxin Li, Cong Ma, Yuxin Chen, Yuejie Chi:
Nonconvex Matrix Factorization From Rank-One Measurements. 1928-1950 - Shao-Lun Huang, Xiangxiang Xu:
On the Sample Complexity of HGR Maximal Correlation Functions for Large Datasets. 1951-1980 - Mark Bun, Gautam Kamath, Thomas Steinke, Zhiwei Steven Wu:
Private Hypothesis Selection. 1981-2000 - Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Agglomerative Info-Clustering: Maximizing Normalized Total Correlation. 2001-2011
Volume 67, Number 4, April 2021
- Ehsan Asadi Kangarshahi, Albert Guillén i Fàbregas:
A Single-Letter Upper Bound to the Mismatch Capacity. 2013-2033 - Ali Haghi, Amir K. Khandani:
Boundary of the Gaussian Han-Kobayashi Rate Region. 2034-2054 - Lin Zhou, Alfred O. Hero III:
Resolution Limits for the Noisy Non-Adaptive 20 Questions Problem. 2055-2073