default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIEEE Transactions on Information Theory, Volume 69
Volume 69, Number 1, January 2023
- Adriano Pastore
, Sung Hoon Lim, Chen Feng, Bobak Nazer, Michael Gastpar:
A Unified Discretization Approach to Compute-Forward: From Discrete to Continuous Inputs. 1-46 - Yong Fang:
-Ary Distributed Arithmetic Coding for Uniform -Ary Sources. 47-74 - Gaojun Luo, Martianus Frederic Ezerman, San Ling:
Three New Constructions of Optimal Locally Repairable Codes From Matrix-Product Codes. 75-85 - Luca G. Tallini, Nawaf Alqwaifly, Bella Bose:
Deletions and Insertions of the Symbol "0" and Asymmetric/Unidirectional Error Control Codes for the L Metric. 86-106 - Hanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee, You Wu, Guojun Han, Mario Blaum:
A Generalization of Array Codes With Local Properties and Efficient Encoding/Decoding. 107-125 - Hiram H. López, Gretchen L. Matthews:
Multivariate Goppa Codes. 126-137 - Yan Xu, Changjiang Ji, Ran Tao, Sihuang Hu:
Extended Cyclic Codes Sandwiched Between Reed-Muller Codes. 138-146 - Wenjun Yu, Yuanxiao Xi, Xin Wei, Gennian Ge:
Balanced Set Codes With Small Intersections. 147-156 - Shuangqing Liu, Lijun Ji:
Double Multilevel Constructions for Constant Dimension Codes. 157-168 - Ryan Gabrys, Venkatesan Guruswami, João Ribeiro, Ke Wu:
Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions. 169-186 - Kees A. Schouhamer Immink, Jos H. Weber:
Minimally Modified Balanced Codes. 187-193 - Mohamed Salman, Mahesh K. Varanasi:
The -User DM Broadcast Channel With Two Groupcast Messages: Achievable Rate Regions and the Combination Network as a Case Study. 194-222 - Mohamed Salman, Mahesh K. Varanasi:
Diamond Message Set Groupcasting: From an Inner Bound for the DM Broadcast Channel to the Capacity Region of the Combination Network. 223-237 - Antonino Favano, Marco Ferrari, Maurizio Magarini, Luca Barletta:
A Sphere Packing Bound for Vector Gaussian Fading Channels Under Peak Amplitude Constraints. 238-250 - Bang-Hai Wang:
Internal Boundary Between Entanglement and Separability Within a Quantum State. 251-261 - Jihao Fan, Jun Li, Ya Wang, Yonghui Li, Min-Hsiu Hsieh, Jiangfeng Du:
Partially Concatenated Calderbank-Shor-Steane Codes Achieving the Quantum Gilbert-Varshamov Bound Asymptotically. 262-272 - Qisheng Wang, Zhicheng Zhang, Kean Chen, Ji Guan, Wang Fang, Junyi Liu, Mingsheng Ying:
Quantum Algorithm for Fidelity Estimation. 273-282 - Christoph Hirche, Felix Leditzky:
Bounding Quantum Capacities via Partial Orders and Complementarity. 283-297 - Yiming Liu, Ying-Chang Liang, Guangming Pan, Zhixiang Zhang:
Random or Nonrandom Signal in High-Dimensional Regimes. 298-315 - Mahsa Taheri, Néhémy Lim, Johannes Lederer:
Balancing Statistical and Computational Precision: A General Theory and Applications to Sparse Regression. 316-333 - Yun Wei, Bala Rajaratnam, Alfred O. Hero III:
A Unified Framework for Correlation Mining in Ultra-High Dimension. 334-382 - Jianjun Wang, Jingyao Hou, Yonina C. Eldar:
Tensor Robust Principal Component Analysis From Multilevel Quantized Observations. 383-406 - Changxiao Cai, H. Vincent Poor, Yuxin Chen:
Uncertainty Quantification for Nonconvex Tensor Completion: Confidence Intervals, Heteroscedasticity and Optimality. 407-452 - Qiaosheng Eric Zhang, Vincent Y. F. Tan:
Exact Recovery in the General Hypergraph Stochastic Block Model. 453-471 - Salem Said, Simon Heuveline, Cyrus Mostajeran:
Riemannian Statistics Meets Random Matrix Theory: Toward Learning From High-Dimensional Covariance Matrices. 472-481 - Ingrid Daubechies, Ronald A. DeVore, Nadav Dym, Shira Faigenbaum-Golovin, Shahar Z. Kovalsky, Kung-Ching Lin, Josiah Park, Guergana Petrova, Barak Sober:
Neural Network Approximation of Refinable Functions. 482-495 - Eric Graves, Allison Beemer, Jörg Kliewer, Oliver Kosut, Paul L. Yu:
Keyless Authentication for AWGN Channels. 496-519 - March Boedihardjo, Thomas Strohmer, Roman Vershynin:
Privacy of Synthetic Data: A Statistical Framework. 520-527 - Jiaming Xu, Kuang Xu, Dana Yang:
Learner-Private Convex Optimization. 528-547 - Mingjie Gao, Ka-Fai Cedric Yiu:
Asymptotic Behaviors and Confidence Intervals for the Number of Operating Sensors in a Sensor Network. 548-560 - Weiqi Li, Zhiying Wang, Taiting Lu, Hamid Jafarkhani:
Storage Codes With Flexible Number of Nodes. 561-574 - Lutz Warnke, Bill Correll Jr., Christopher N. Swanson:
The Density of Costas Arrays Decays Exponentially. 575-581 - Ziran Tu, Nian Li, Yanan Wu, Xiangyong Zeng, Xiaohu Tang, Yupeng Jiang:
On the Differential Spectrum and the APcN Property of a Class of Power Functions Over Finite Fields. 582-597 - Ming Li, Dongdai Lin:
Partial Cycle Structure of FSRs and Its Applications in Searching De Bruijn Sequences. 598-609 - Zhifan Ye, Zhengchun Zhou, Zi Long Liu, Xiaohu Tang, Pingzhi Fan:
New Spectrally Constrained Sequence Sets With Optimal Periodic Cross-Correlation. 610-625 - Touheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan:
Source Coding for Synthesizing Correlated Randomness. 626-649 - Guangcan Liu, Wayne Zhang:
Recovery of Future Data via Convolution Nuclear Norm Minimization. 650-665 - Zai Yang:
Nonasymptotic Performance Analysis of ESPRIT and Spatial-Smoothing ESPRIT. 666-681 - Holger Boche, Yannik N. Böck, Ullrich J. Mönich:
On the Arithmetic Complexity of the Bandwidth of Bandlimited Signals. 682-702
Volume 69, Number 2, February 2023
- Abdellatif Zaidi:
Rate-Exponent Region for a Class of Distributed Hypothesis Testing Against Conditional Independence Problems. 703-718 - Payam Delgosha, Venkat Anantharam:
A Universal Lossless Compression Method Applicable to Sparse Graphs and Heavy-Tailed Sparse Graphs. 719-751 - Francis R. Bach:
Information Theory With Kernel Methods. 752-775 - Giuseppe Cocco, Albert Guillén i Fàbregas, Josep Font-Segura:
Typical Error Exponents: A Dual Domain Derivation. 776-793 - Mihai-Alin Badiu, Justin P. Coon:
Structural Complexity of One-Dimensional Random Geometric Graphs. 794-812 - Vishesh Jain, Ashwin Sah, Mehtaab Sawhney:
Optimal Minimization of the Covariance Loss. 813-818 - Dongchun Han, Yuan Ren:
A Tight Upper Bound for the Maximal Length of MDS Elliptic Codes. 819-822 - Mustafa Cemil Coskun, Gianluigi Liva, Alexandre Graell i Amat, Michael Lentmaier, Henry D. Pfister:
Successive Cancellation Decoding of Single Parity-Check Product Codes: Analysis and Improved Decoding. 823-841 - D. Shivakrishna, Aaditya M. Nair, V. Lalitha:
Maximally Recoverable Codes With Hierarchical Locality: Constructions and Field-Size Bounds. 842-859 - Gustavo Kasper Facenda, Elad Domanovitz, Ashish Khisti, Wai-Tian Tan, John G. Apostolopoulos:
Streaming Erasure Codes Over Multi-Access Relayed Networks. 860-885 - Siyi Yang, Ahmed H. Hareedy, A. Robert Calderbank, Lara Dolecek:
Breaking the Computational Bottleneck: Probabilistic Optimization of High-Memory Spatially-Coupled Codes. 886-909 - Issam Maarouf, Andreas Lenz, Lorenz Welter, Antonia Wachter-Zeh, Eirik Rosnes, Alexandre Graell i Amat:
Concatenated Codes for Multiple Reads of a DNA Sequence. 910-927 - Shu Liu, Chaoping Xing:
Bounds and Constructions for Insertion and Deletion Codes. 928-940 - Bocong Chen, Hongwei Liu:
New Bounds on the Code Size of Symbol-Pair Codes. 941-950 - Hengjia Wei, Moshe Schwartz:
Perfect Codes Correcting a Single Burst of Limited-Magnitude Errors. 951-962 - Abhishek Bhowmick, Shachar Lovett:
Bias vs Structure of Polynomials in Large Fields, and Applications in Information Theory. 963-977 - Ziling Heng:
Projective Linear Codes From Some Almost Difference Sets. 978-994 - Bocong Chen, Guanghui Zhang:
A Tight Upper Bound on the Number of Non-Zero Weights of a Cyclic Code. 995-1004 - Bocong Chen, San Ling, Hongwei Liu:
Hulls of Reed-Solomon Codes via Algebraic Geometry Codes. 1005-1014 - Jiajun Chen, Chi Wan Sung, Terence H. Chan:
Heterogeneity Shifts the Storage-Computation Tradeoff in Secure Multi-Cloud Systems. 1015-1036 - Federico Brunero, Petros Elia:
Fundamental Limits of Combinatorial Multi-Access Caching. 1037-1056 - Gergely Bunth, Péter Vrana:
Equivariant Relative Submajorization. 1057-1073 - Milán Mosonyi, Fumio Hiai:
Test-Measured Rényi Divergences. 1074-1092 - Saurabh Sihag, Ali Tajer:
Estimating Structurally Similar Graphical Models. 1093-1124 - Rahul Parhi, Robert D. Nowak:
Near-Minimax Optimal Estimation With Shallow ReLU Neural Networks. 1125-1140 - Souvik Ray, Subrata Pal, Sumit Kumar Kar, Ayanendranath Basu:
Characterizing the Functional Density Power Divergence Class. 1141-1146 - Yuefeng Han, Cun-Hui Zhang:
Tensor Principal Component Analysis in High Dimensional CP Models. 1147-1167 - László Györfi, Aryeh Kontorovich, Roi Weiss:
Tree Density Estimation. 1168-1176 - Seyedehsara Nayer, Namrata Vaswani:
Fast and Sample-Efficient Federated Low Rank Matrix Recovery From Column-Wise Linear and Quadratic Projections. 1177-1202 - Masaaki Imaizumi, Johannes Schmidt-Hieber:
On Generalization Bounds for Deep Networks Based on Loss Surface Implicit Regularization. 1203-1223 - Nelvin Tan, Way Tan, Jonathan Scarlett:
Performance Bounds for Group Testing With Doubly-Regular Designs. 1224-1243 - Matey Neykov:
On the Minimax Rate of the Gaussian Sequence Model Under Bounded Convex Constraints. 1244-1260 - Wei-Ning Chen, Peter Kairouz, Ayfer Özgür:
Breaking the Communication-Privacy-Accuracy Trilemma. 1261-1281 - Kai Zhang, Xuejia Lai, Lei Wang, Jie Guan, Bin Hu, Senpeng Wang, Tairong Shi:
Rotational-XOR Differential Cryptanalysis and an Automatic Framework for AND-RX Ciphers. 1282-1294 - Haoyue Tang, Yuchao Chen, Jintao Wang, Pengkun Yang, Leandros Tassiulas:
Age Optimal Sampling Under Unknown Delay Statistics. 1295-1314 - Sihem Mesnager, Mu Yuan, Dabin Zheng:
More About the Corpus of Involutions From Two-to-One Mappings and Related Cryptographic S-Boxes. 1315-1327 - Hui Zhang, Cuiling Fan, Yang Yang, Sihem Mesnager:
New Binary Cross Z-Complementary Pairs With Large CZC Ratio. 1328-1336 - Mohannad H. Al-Ali, K. C. Ho:
Objective Bayesian Approach for Binary Hypothesis Testing of Multivariate Gaussian Observations. 1337-1354 - Michele Cirillo, Vincenzo Matta, Ali H. Sayed:
Estimating the Topology of Preferential Attachment Graphs Under Partial Observability. 1355-1380
Volume 69, Number 3, March 2023
- Masahito Hayashi:
Analytical Algorithm for Capacities of Classical and Classical-Quantum Channels. 1381-1393 - Joel R. Peck, David Waxman:
Homogenizing Entropy Across Different Environmental Conditions: A Universally Applicable Method for Transforming Continuous Variables. 1394-1412 - Xiwei Cheng, Sidharth Jaggi, Qiaoqiao Zhou:
Generalized Group Testing. 1413-1451 - Spencer Congero, Kenneth Zeger:
The 3/4 Conjecture for Fix-Free Codes With at Most Three Distinct Codeword Lengths. 1452-1485 - Sotirios K. Michos, Panagiotis D. Diamantoulakis, Leonidas Georgiadis, George K. Karagiannidis:
On the Computational Aspect of Coded Caching With Uncoded Prefetching. 1486-1508 - Fernando L. Piñero, Prasant Singh:
Orbit Structure of Grassmannian G2,m and a Decoder for Grassmann Code C(2, m). 1509-1520 - Yun Fan, Hualu Liu:
Double Constacyclic Codes Over Two Finite Commutative Chain Rings. 1521-1530 - Yu Luo, Zihui Liu:
On the Subcode-Support-Weight Distributions of Some Classes of Optimal Codes. 1531-1543 - Bocong Chen, Guanghui Zhang, Wenyan Li:
New Optimal Linear Codes With Hierarchical Locality. 1544-1550 - Jie Li, Xiaohu Tang, Hanxu Hou, Yunghsiang S. Han, Bo Bai, Gong Zhang:
PMDS Array Codes With Small Sub-Packetization, Small Repair Bandwidth/Rebuilding Access. 1551-1566 - Gaojun Luo, Martianus Frederic Ezerman, San Ling, Xu Pan:
New Families of MDS Symbol-Pair Codes From Matrix-Product Codes. 1567-1587 - Steven T. Dougherty, Adrian Korban, Serap Sahinkaya, Deniz Ustun:
Construction of DNA Codes From Composite Matrices and a Bio-Inspired Optimization Algorithm. 1588-1603 - Mark A. Graham, Ayalvadi J. Ganesh, Robert J. Piechocki:
Low Latency Allcast Over Broadcast Erasure Channels. 1604-1617 - Junyuan Gao, Yongpeng Wu, Shuo Shao, Wei Yang, H. Vincent Poor:
Energy Efficiency of Massive Random Access in MIMO Quasi-Static Rayleigh Fading Channels With Finite Blocklength. 1618-1657 - Yash Deshpande, Cedomir Stefanovic, H. Murat Gürsu, Wolfgang Kellerer:
Corrections to "High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm". 1658-1659 - Eric Chitambar, Ian George, Brian Doolittle, Marius Junge:
The Communication Value of a Quantum Channel. 1660-1679 - Ke Li, Yongsheng Yao, Masahito Hayashi:
Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification. 1680-1694 - Nilanjana Laha, Rajarshi Mukherjee:
On Support Recovery With Sparse CCA: Information Theoretic and Computational Limits. 1695-1738 - Luiz F. O. Chamon, Santiago Paternain, Miguel Calvo-Fullana, Alejandro Ribeiro:
Constrained Learning With Non-Convex Losses. 1739-1760 - Sujay Bhatt, Ping Li, Gennady Samorodnitsky:
Extreme Bandits Using Robust Statistics. 1761-1776 - Kweku Abraham, Elisabeth Gassiat, Zacharie Naulet:
Fundamental Limits for Learning Hidden Markov Model Parameters. 1777-1794 - Sébastien Bubeck, Mark Sellke:
First-Order Bayesian Regret Analysis of Thompson Sampling. 1795-1823 - Cédric Gerbelot, Alia Abbara, Florent Krzakala:
Asymptotic Errors for Teacher-Student Convex Generalized Linear Models (Or: How to Prove Kabashima's Replica Formula). 1824-1852 - Mati Wax, Amir Adler:
Vector Set Classification by Signal Subspace Matching. 1853-1865 - Andrew D. McRae, Justin Romberg, Mark A. Davenport:
Optimal Convex Lifted Sparse Phase Retrieval and PCA With an Atomic Matrix Norm Regularizer. 1866-1882 - Alex Dytso, H. Vincent Poor, Shlomo Shamai Shitz:
Conditional Mean Estimation in Gaussian Noise: A Meta Derivative Identity With Applications. 1883-1898 - Xiucai Ding, Hau-Tieng Wu:
Impact of Signal-to-Noise Ratio and Bandwidth on Graph Laplacian Spectrum From High-Dimensional Noisy Point Cloud. 1899-1931 - Hong Hu, Yue M. Lu:
Universality Laws for High-Dimensional Learning With Random Features. 1932-1964 - Ajaykrishnan Nageswaran, Prakash Narayan:
Corrections to "Distribution Privacy Under Function Recoverability". 1965 - Adel M. Elmahdy, Michelle Kleckler, Soheil Mohajer:
Secure Determinant Codes for Distributed Storage Systems. 1966-1987 - Faruk Göloglu:
Classification of (q, q)-Biprojective APN Functions. 1988-1999 - Jiajie Liu, Bing Sun, Guoqiang Liu, Xinfeng Dong, Li Liu, Hua Zhang, Chao Li:
New Wine Old Bottles: Feistel Structure Revised. 2000-2008 - Omer Bilgen, Aaron B. Wagner:
Rate Region of the One-Help-Two Quadratic Gaussian Source-Coding Problem With Markovity. 2009-2032 - Virginia Bordignon, Vincenzo Matta, Ali H. Sayed:
Partial Information Sharing Over Social Learning Networks. 2033-2058
Volume 69, Number 4, April 2023
- Yikun Bai, Xiugang Wu, Ayfer Özgür:
Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover. 2059-2073 - Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza:
Toward a Definitive Compressibility Measure for Repetitive Sequences. 2074-2092 - Kumar K. P. Vijith, Brijesh Kumar Rai, Tony Jacob:
Towards the Optimal Rate Memory Tradeoff in Caching With Coded Placement. 2093-2112 - Shota Saito, Toshiyasu Matsushima:
Non-Asymptotic Bounds of Cumulant Generating Function of Codeword Lengths in Variable-Length Lossy Compression. 2113-2119 - Ran Tamir:
Entropy Rate Bounds of Integer-Valued Processes via Second-Order Statistics. 2120-2134 - Shraga I. Bross:
Source Coding With a Listening-Helper. 2135-2151 - Neri Merhav, Georg Böcherer:
Codebook Mismatch can be Fully Compensated by Mismatched Decoding. 2152-2164 - Nian Guo, Victoria Kostina:
Reliability Function for Streaming Over a DMC With Feedback. 2165-2192 - Martina Cardone, Alex Dytso, Cynthia Rush:
Entropic Central Limit Theorem for Order Statistics. 2193-2205