default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIEEE Transactions on Information Theory, Volume 66
Volume 66, Number 1, January 2020
- Madhu Sudan, Himanshu Tyagi
, Shun Watanabe:
Communication for Generating Correlation: A Unifying Survey. 5-37 - Meryem Benammar, Pablo Piantanida, Shlomo Shamai:
On the Compound Broadcast Channel: Multiple Description Coding and Interference Decoding. 38-64 - Mohamed Salman, Mahesh K. Varanasi:
Capacity Results for Classes of Partially Ordered K-User Broadcast Channels With Two Nested Multicast Messages. 65-81 - Minh Thanh Vu, Tobias J. Oechtering, Mikael Skoglund:
Hierarchical Identification With Pre-Processing. 82-113 - Neri Merhav, Asaf Cohen:
Universal Randomized Guessing With Application to Asynchronous Decentralized Brute-Force Attacks. 114-129 - Joschka Roffe, Stefan Zohren, Dominic Horsman, Nicholas Chancellor:
Quantum Codes From Classical Graphical Models. 130-146 - Mizanur Rahaman:
A New Bound on Quantum Wielandt Inequality. 147-154 - Asger Kjærulff Jensen, Péter Vrana:
The Asymptotic Spectrum of LOCC Transformations. 155-166 - Giacomo Micheli:
Constructions of Locally Recoverable Codes Which are Optimal. 167-175 - Fangwei Ye, Shiqiu Liu, Kenneth W. Shum, Raymond W. Yeung:
On Secure Exact-Repair Regenerating Codes With a Single Pareto Optimal Point. 176-201 - Lingfei Jin, Haibin Kan, Yu Zhang:
Constructions of Locally Repairable Codes With Multiple Recovering Sets via Rational Function Fields. 202-209 - Lingfei Jin, Liming Ma, Chaoping Xing:
Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields. 210-221 - Ehsan Yavari, Morteza Esmaeili:
Locally Repairable Codes: Joint Sequential-Parallel Repair for Multiple Node Failures. 222-232 - Jianfa Qian, Lina Zhang:
New Optimal Cyclic Locally Recoverable Codes of Length n=2(q+1). 233-239 - Hai Q. Dinh, Bac Trong Nguyen, Songsak Sriboonchitta:
MDS Symbol-Pair Cyclic Codes of Length 2ps over 𝔽pm. 240-262 - Ronald Cramer, Chaoping Xing, Chen Yuan:
Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex. 263-272 - Jürgen Bierbrauer, Stefano Marcugini, Fernanda Pambianco:
Additive Quaternary Codes Related to Exceptional Linear Quaternary Codes. 273-277 - Sanghamitra Dutta, Mohammad Fahim, Farzin Haddadpour, Haewon Jeong, Viveck R. Cadambe, Pulkit Grover:
On the Optimal Recovery Threshold of Coded Matrix Multiplication. 278-301 - Daniel Russo, James Zou:
How Much Does Your Data Exploration Overfit? Controlling Bias via Information Usage. 302-323 - Liangjun Su, Wuyi Wang, Yichong Zhang:
Strong Consistency of Spectral Clustering for Stochastic Block Models. 324-338 - Aditya Kela, Kai Von Prillwitz, Johan Åberg, Rafael Chaves, David Gross:
Semidefinite Tests for Latent Causal Structures. 339-349 - Shang Li, Xiaodong Wang:
Distributed Sequential Hypothesis Testing With Quantized Message-Exchange. 350-367 - Keigo Takeuchi:
Rigorous Dynamics of Expectation-Propagation-Based Signal Recovery from Unitarily Invariant Measurements. 368-386 - Shirin Jalali:
Toward Theoretically Founded Learning-Based Compressed Sensing. 387-400 - Paul Hand, Vladislav Voroninski:
Global Guarantees for Enforcing Deep Generative Priors by Empirical Risk. 401-418 - Yuqian Zhang, Han-Wen Kuo, John Wright:
Structured Local Optima in Sparse Blind Deconvolution. 419-452 - Martin Genzel, Peter Jung:
Recovering Structured Data From Superimposed Non-Linear Measurements. 453-477 - Mansoor I. Yousefi, Xianhe Yangzhang:
Linear and Nonlinear Frequency-Division Multiplexing. 478-495 - Alejandro Lancho, Tobias Koch, Giuseppe Durisi:
On Single-Antenna Rayleigh Block-Fading Channels at Finite Blocklength. 496-519 - Xinping Yi, Hua Sun:
Opportunistic Treating Interference as Noise. 520-533 - Ahmed Arafa, Jing Yang, Sennur Ulukus, H. Vincent Poor:
Age-Minimal Transmission for Energy Harvesting Sensors With Finite Batteries: Online Policies. 534-556 - Simon R. Blackburn, Tuvi Etzion, Maura B. Paterson:
PIR Schemes With Small Download Complexity and Low Storage Requirements. 557-571 - Rémi A. Chou, Aylin Yener:
Strongly Secure Multiuser Communication and Authentication With Anonymity Constraints. 572-586 - Augusto Santos, Vincenzo Matta, Ali H. Sayed:
Local Tomography of Large Networks Under the Low-Observability Regime. 587-613 - Omer Bilgen, Aaron B. Wagner:
A New Stable Peer-to-Peer Protocol With Non-Persistent Peers: The Group Suppression Protocol. 614-632 - Seyed Ali Saberali, Lutz Lampe, Ian F. Blake:
Full Characterization of Optimal Uncoded Placement for the Structured Clique Cover Delivery of Nonuniform Demands. 633-648 - Jorge F. Silva, Pablo Piantanida:
Universal Weak Variable-Length Source Coding on Countably Infinite Alphabets. 649-668 - Avik Ranjan Adhikary, Sudhan Majhi, Zi Long Liu, Yong Liang Guan:
New Sets of Optimal Odd-Length Binary Z-Complementary Pairs. 669-678 - Daniel Gabric, Joe Sawada, Aaron Williams, Dennis Wong:
A Successor Rule Framework for Constructing k-Ary de Bruijn Sequences and Universal Cycles. 679-687
Volume 66, Number 2, February 2020
- Himanshu Tyagi, Shun Watanabe:
Strong Converse Using Change of Measure Arguments. 689-703 - Jingbo Liu, Thomas A. Courtade, Paul Cuff, Sergio Verdú:
Smoothing Brascamp-Lieb Inequalities and Strong Converses of Coding Theorems. 704-721 - Lan V. Truong, Hirosuke Yamamoto:
On the Capacity of Symmetric M-User Gaussian Interference Channels With Feedback. 722-741 - Alex Samorodnitsky:
An Upper Bound on $\ell_q$ Norms of Noisy Functions. 742-748 - Marco Dalai, Venkatesan Guruswami, Jaikumar Radhakrishnan:
An Improved Bound on the Zero-Error List-Decoding Capacity of the 4/3 Channel. 749-756 - Uzi Pereg, Yossef Steinberg:
The Arbitrarily Varying Broadcast Channel With Causal Side Information at the Encoder. 757-779 - Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Broadcasting on Random Directed Acyclic Graphs. 780-812 - Seiyun Shin, Changho Suh:
Two-Way Function Computation. 813-834 - Eric Graves, Tan F. Wong:
Inducing Information Stability to Obtain Information Theoretic Necessary Requirements. 835-864 - Daming Cao, Vincent Y. F. Tan:
Exact Error and Erasure Exponents for the Asymmetric Broadcast Channel. 865-885 - Zitan Chen, Alexander Barg:
Explicit Constructions of MSR Codes for Clustered Distributed Storage: The Rack-Aware Storage Model. 886-899 - Michael Langberg, Michelle Effros:
The Edge-Removal Problem's Connections to the Zero-Error and $\delta$ -Dependence Problems in Network Coding. 900-913 - Yanbin Zheng, Qiang Wang, Wenhong Wei:
On Inverses of Permutation Polynomials of Small Degree Over Finite Fields. 914-922 - Liqin Qian, Xiwang Cao:
Bounds and Optimal $q$ -Ary Codes Derived From the $\mathbb{Z}_qR$ -Cyclic Codes. 923-935 - Mario Blaum:
Extended Integrated Interleaved Codes Over Any Field With Applications to Locally Recoverable Codes. 936-956 - Yeow Meng Chee, San Ling, Tuan Thanh Nguyen, Van Khu Vu, Hengjia Wei, Xiande Zhang:
Burst-Deletion-Correcting Codes for Permutations and Multipermutations. 957-969 - Cristina Fernández-Córdoba, Carlos Vela, Mercè Villanueva:
On $\mathbb{Z}_{\text{8}}$ -Linear Hadamard Codes: Rank and Classification. 970-982 - Bing Zhu, Kenneth W. Shum, Hui Li:
Fractional Repetition Codes With Optimal Reconstruction Degree. 983-994 - Yaqian Zhang, Zhifang Zhang:
Scalar MSCR Codes via the Product Matrix Construction. 995-1006 - Eduardo Camps, Edgar Martínez-Moro, Eliseo Sarmiento Rosales:
Vardøhus Codes: Polar Codes Based on Castle Curves Kernels. 1007-1022 - Balaji Srinivasan Babu, Ganesh R. Kini, P. Vijay Kumar:
A Tight Rate Bound and Matching Construction for Locally Recoverable Codes With Sequential Recovery From Any Number of Multiple Erasures. 1023-1052 - Tao Guo, Raymond W. Yeung:
The Explicit Coding Rate Region of Symmetric Multilevel Diversity Coding. 1053-1077 - Ali Ahmed, Justin Romberg:
Compressive Sampling of Ensembles of Correlated Signals. 1078-1098 - Chao Zhang, Xianjie Gao, Min-Hsiu Hsieh, Hanyuan Hang, Dacheng Tao:
Matrix Infinitely Divisible Series: Tail Inequalities and Their Applications. 1099-1117 - Yin Sun, Yury Polyanskiy, Elif Uysal:
Sampling of the Wiener Process for Remote Estimation Over a Channel With Random Delay. 1118-1135 - Amichai Painsky, Saharon Rosset, Meir Feder:
Innovation Representation of Stochastic Processes With Application to Causal Inference. 1136-1154 - Daniel E. Clark:
Local Entropy Statistics for Point Processes. 1155-1163 - Atsushi Iwasaki:
Deriving the Variance of the Discrete Fourier Transform Test Using Parseval's Theorem. 1164-1170 - Yodai Watanabe:
Randomness Extraction via a Quantum Generalization of the Conditional Collision Entropy. 1171-1177 - Seunghoan Song, Masahito Hayashi:
Secure Quantum Network Code Without Classical Communication. 1178-1192 - Tolunay Seyfi, Yasemin Karacora, Aly El Gamal:
Fundamental Limits of Dynamic Interference Management With Flexible Message Assignments and Separate Deep Fading Block Coding. 1193-1212 - Xianhua Niu, Chaoping Xing, Chen Yuan:
Asymptotic Gilbert-Varshamov Bound on Frequency Hopping Sequences. 1213-1218 - Subhamoy Maitra, Bimal Mandal, Thor Martinsen, Dibyendu Roy, Pantelimon Stanica:
Analysis on Boolean Function in a Restricted (Biased) Domain. 1219-1231 - Morgane Austern, Arian Maleki:
On the Gaussianity of Kolmogorov Complexity of Mixing Sequences. 1232-1247 - Huan Li, Stacy Patterson, Yuhao Yi, Zhongzhi Zhang:
Maximizing the Number of Spanning Trees in a Connected Graph. 1248-1260 - Ehsan Nekouei, Girish N. Nair, Tansu Alpcan, Robin J. Evans:
Sample Complexity of Solving Non-Cooperative Games. 1261-1280
Volume 66, Number 3, March 2020
- Eirik Rosnes, Michael Helmling:
Adaptive Linear Programming Decoding of Nonbinary Linear Codes Over Prime Fields. 1281-1317 - Kai Wan, Daniela Tuninetti, Pablo Piantanida:
An Index Coding Approach to Caching With Uncoded Cache Placement. 1318-1332 - Linqi Song, Christina Fragouli, Tianchu Zhao:
A Pliable Index Coding Approach to Data Shuffling. 1333-1353 - Qiaosheng Eric Zhang, Mayank Bakshi, Sidharth Jaggi:
Covert Communication With Polynomial Computational Complexity. 1354-1384 - Ohad Elishco, Ryan Gabrys, Eitan Yaakobi:
Bounds and Constructions of Codes Over Symbol-Pair Read Channels. 1385-1395 - Itzhak Tamo, Min Ye, Alexander Barg:
Error Correction Based on Partial Information. 1396-1404 - Hanxu Hou, Patrick P. C. Lee:
Binary MDS Array Codes With Optimal Repair. 1405-1422 - Denis S. Krotov:
The Existence of Perfect Codes in Doob Graphs. 1423-1427 - Ning Cai, Masahito Hayashi:
Secure Network Code for Adaptive and Active Attacks With No-Randomness in Intermediate Nodes. 1428-1448 - Minjia Shi, Xiaoxiao Li, Alessandro Neri, Patrick Solé:
How Many Weights Can a Cyclic Code Have? 1449-1459 - Lior Eldar, Maris Ozols, Kevin Thompson:
The Need for Structure in Quantum LDPC Codes. 1460-1473 - Hamed Narimani, Mohammadali Khosravifard:
A New Code for Encoding All Monotone Sources With a Fixed Large Alphabet Size. 1474-1481 - Elad Domanovitz, Uri Erez:
Achievability Performance Bounds for Integer-Forcing Source Coding. 1482-1496 - Ziv Goldfeld, Paul Cuff, Haim H. Permuter:
Wiretap Channels With Random States Non-Causally Available at the Encoder. 1497-1519 - Fatemeh Arbabjolfaei, Young-Han Kim:
Generalized Lexicographic Products and the Index Coding Capacity. 1520-1529 - Jiangfan Zhang, Xiaodong Wang:
Asymptotically Optimal Stochastic Encryption for Quantized Sequential Detection in the Presence of Eavesdroppers. 1530-1548 - Pinar Sen, Young-Han Kim:
Homologous Codes for Multiple Access Channels. 1549-1571 - Antonio Campello, Cong Ling, Jean-Claude Belfiore:
Semantically Secure Lattice Codes for Compound MIMO Channels. 1572-1584 - Yutaka Jitsumatsu, Yasutada Oohama:
A New Iterative Algorithm for Computing the Correct Decoding Probability Exponent of Discrete Memoryless Channels. 1585-1606 - Mehrdad Tahmasbi, Matthieu R. Bloch, Aylin Yener:
Learning an Adversary's Actions for Secret Communication. 1607-1624 - Ibrahim Issa, Aaron B. Wagner, Sudeep Kamath:
An Operational Approach to Information Leakage. 1625-1657 - Amichai Painsky, Gregory W. Wornell:
Bregman Divergence Bounds and Universality Properties of the Logarithmic Loss. 1658-1673 - Shigeaki Kuzuoka:
On the Conditional Smooth Rényi Entropy and its Applications in Guessing and Source Coding. 1674-1690 - Shun Watanabe, Te Sun Han:
Interval Algorithm for Random Number Generation: Information Spectrum Approach. 1691-1701 - Daniil Ryabko:
Time-Series Information and Unsupervised Learning of Representations. 1702-1713 - Xiao-Yang Liu, Shuchin Aeron, Vaneet Aggarwal, Xiaodong Wang:
Low-Tubal-Rank Tensor Completion Using Alternating Minimization. 1714-1737 - Dongmian Zou, Radu V. Balan, Maneesh Singh:
On Lipschitz Bounds of General Convolutional Neural Networks. 1738-1759 - Yihua Li, Devavrat Shah, Dogyoon Song, Christina Lee Yu:
Nearest Neighbors for Matrix Estimation Interpreted as Blind Regression for Latent Variable Model. 1760-1784 - Qing Qu, Yuqian Zhang, Yonina C. Eldar, John Wright:
Convolutional Phase Retrieval via Gradient Descent. 1785-1821 - Weiyu Xu, Haider Ali Jasim Alshamary, Tareq Y. Al-Naffouri, Alam Zaib:
Optimal Joint Channel Estimation and Data Detection for Massive SIMO Wireless Systems: A Polynomial Complexity Solution. 1822-1844 - Qianrui Li, Paul de Kerret, David Gesbert, Nicolas Gresset:
Robust Regularized ZF in Cooperative Broadcast Channel Under Distributed CSIT. 1845-1860 - Mirza Uzair Baig, Lei Yu, Zixiang Xiong, Anders Høst-Madsen, Houqiang Li, Weiping Li:
On the Energy-Delay Tradeoff in Streaming Data: Finite Blocklength Analysis. 1861-1881 - Qing He, Di Yuan, Anthony Ephremides:
Optimal Scheduling for Emptying a Wireless Network: Solution Characterization, Applications, Including Deadline Constraints. 1882-1892 - Alexander Michael Daniel, Wei Yu:
Optimization of Heterogeneous Coded Caching. 1893-1919 - Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding. 1920-1933 - Suhri Kim, Kisoon Yoon, Jihoon Kwon, Young-Ho Park, Seokhie Hong:
New Hybrid Method for Isogeny-Based Cryptosystems Using Edwards Curves. 1934-1943 - Hassan Aly, Arne Winterhof:
A Note on Hall's Sextic Residue Sequence: Correlation Measure of Order $k$ and Related Measures of Pseudorandomness. 1944-1947 - Anders Høst-Madsen:
Corrections to "The Wideband Slope of Interference Channels: The Small Bandwidth Case". 1948
Volume 66, Number 4, April 2020
- Mario Díaz, Hao Wang, Flávio P. Calmon, Lalitha Sankar:
On the Robustness of Information-Theoretic Privacy Measures and Mechanisms. 1949-1978 - Mehrdad Tahmasbi, Anne Savard, Matthieu R. Bloch:
Covert Capacity of Non-Coherent Rayleigh-Fading Channels. 1979-2005 - Alex Dytso, Semih Yagli, H. Vincent Poor, Shlomo Shamai Shitz:
The Capacity Achieving Distribution for the Amplitude Constrained Additive Gaussian Channel: An Upper Bound on the Number of Mass Points. 2006-2022 - Yi-Peng Wei, Sennur Ulukus:
The Capacity of Private Information Retrieval With Private Side Information Under Storage Constraints. 2023-2031 - Swanand Kadhe, Brenden Garcia, Anoosheh Heidarzadeh, Salim Y. El Rouayheb, Alex Sprintson:
Private Information Retrieval With Side Information. 2032-2043