Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIEEE Transactions on Information Theory, Volume 70
Volume 70, Number 1, January 2024
- Chengyu Wu
, Yonglong Li, Easton Li Xu, Guangyue Han:
Rényi Entropy Rate of Stationary Ergodic Processes. 1-15 - Bashar Huleihel, Oron Sabag, Haim H. Permuter, Victoria Kostina:
Capacity of Finite-State Channels With Delayed Feedback. 16-29 - Mingming Zhang, Kai Wan, Minquan Cheng, Giuseppe Caire:
Coded Caching for Two-Dimensional Multi-Access Networks With Cyclic Wrap Around. 30-50 - Farzane Amirzade, Mohammad-Reza Sadeghi, Daniel Panario:
Construction of Protograph-Based LDPC Codes With Chordless Short Cycles. 51-74 - Eric Ruzomberka, Chih-Chun Wang, David J. Love:
Channel Capacity for Adversaries With Computationally Bounded Observations. 75-92 - Zhonghua Sun, Cunsheng Ding, Xiaoqiang Wang:
Two Classes of Constacyclic Codes With Variable Parameters [(qm - 1)/r, k, d]. 93-114 - Bocong Chen, Guanghui Zhang:
Enumeration and Generation of Cyclically Permutable Codes From Cyclic Codes. 115-124 - Noga Alon, Gabriela Bourla, Ben Graham, Xiaoyu He, Noah Kravitz:
Logarithmically Larger Deletion Codes of All Distances. 125-130 - Xiaoqiang Wang, Jiaojiao Wang, Chengju Li, Yansheng Wu:
Two Classes of Narrow-Sense BCH Codes and Their Duals. 131-144 - Haojie Gu, Jun Zhang:
On Twisted Generalized Reed-Solomon Codes With ℓ Twists. 145-153 - Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Decoding Multivariate Multiplicity Codes on Product Sets. 154-169 - Hei Victor Cheng, Wei Yu:
Degree-of-Freedom of Modulating Information in the Phases of Reconfigurable Intelligent Surface. 170-188 - Sergey Loyka, Neri Merhav:
The Secrecy Capacity of the Wiretap Channel With Additive Noise and Rate-Limited Help. 189-205 - Nicholas R. Olson, Jeffrey G. Andrews, Robert W. Heath Jr.:
Coverage and Rate of Joint Communication and Parameter Estimation in Wireless Networks. 206-243 - Yongchang Hu:
Geometric Path Loss Distributions in Wireless Random Networks: Theory and Applications. 244-255 - Rami Ezzine, Moritz Wiese, Christian Deppe, Holger Boche:
Message Transmission and Common Randomness Generation Over MIMO Slow Fading Channels With Arbitrary Channel State Distribution. 256-281 - Matthias Christandl, Alexander Müller-Hermes:
Fault-Tolerant Coding for Quantum Communication. 282-317 - Divesh Aggarwal, Naresh Goud Boddu, Rahul Jain, Maciej Obremski:
Quantum Measurement Adversary. 318-335 - Eyuri Wakakuwa:
Quantum Multiple-Access One-Time Pad. 336-348 - Divesh Aggarwal, Naresh Goud Boddu, Rahul Jain:
Quantum Secure Non-Malleable Codes in the Split-State Model. 349-371 - Yingkai Li, Yining Wang, Yuan Zhou:
Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits. 372-388 - Ankit Pensia, Varun S. Jog, Po-Ling Loh:
Communication-Constrained Hypothesis Testing: Optimality, Robustness, and Reverse Data Processing Inequalities. 389-414 - Dragana Bajovic:
Inaccuracy Rates for Distributed Inference Over Random Networks With Applications to Social Learning. 415-435 - Francesco Orabona, Kwang-Sung Jun:
Tight Concentrations and Confidence Sequences From the Regret of Universal Portfolio. 436-455 - Nicholas Galbraith, Samory Kpotufe:
Classification Tree Pruning Under Covariate Shift. 456-481 - Junjie Ma, Ji Xu, Arian Maleki:
Toward Designing Optimal Sensing Matrices for Generalized Linear Inverse Problems. 482-508 - T. Tony Cai, Rong Ma:
Matrix Reordering for Noisy Disordered Matrices: Optimality and Computationally Efficient Algorithms. 509-531 - Masihuddin, Neeraj Misra:
Shrinkage Estimators Dominating Some Naive Estimators of the Selected Entropy. 532-549 - Muni Sreenivas Pydi, Varun S. Jog:
The Many Faces of Adversarial Risk: An Expanded Study. 550-570 - Ye He, Krishnakumar Balasubramanian, Murat A. Erdogdu:
An Analysis of Transformed Unadjusted Langevin Algorithm for Heavy-Tailed Sampling. 571-593 - Keigo Takeuchi:
Orthogonal Approximate Message-Passing for Spatially Coupled Linear Models. 594-631 - Gholamali Aminian, Yuheng Bu, Laura Toni, Miguel R. D. Rodrigues, Gregory W. Wornell:
Information-Theoretic Characterizations of Generalization Error for the Gibbs Algorithm. 632-655 - Avishek Ghosh, Abishek Sankararaman, Kannan Ramchandran:
Model Selection for Generic Contextual Bandits. 656-675 - Xuan Guang, Yang Bai, Raymond W. Yeung:
Secure Network Function Computation for Linear Functions - Part I: Source Security. 676-697 - Gongpu Chen, Soung Chang Liew:
An Index Policy for Minimizing the Uncertainty-of-Information of Markov Sources. 698-721 - Máté Gyarmati:
Information Ratio of Unicyclic Graphs. 722-734 - Xiao Shen, Lingwei Xu, Yuanpeng Liu, Yuan Shen:
A Theoretical Framework for Relative Localization. 735-762
Volume 70, Number 2, February 2024
- Wael Alghamdi, Flávio P. Calmon:
Measuring Information From Moments. 763-802 - Oisin Faust, Hamza Fawzi:
Sum-of-Squares Proofs of Logarithmic Sobolev Inequalities on Finite Markov Chains. 803-819 - Lan V. Truong, Albert Guillén i Fàbregas:
Generalized Random Gilbert-Varshamov Codes: Typical Error Exponent and Concentration Properties. 820-853 - Qi Cao, Qiaoqiao Zhou:
Zero-Error Capacity of the Chemical Residual Channel. 854-864 - Nadim Ghaddar, Shouvik Ganguly, Lele Wang, Young-Han Kim:
A Lego-Brick Approach to Coding for Network Communication. 865-903 - Viktor Harangi, Xueyan Niu, Bo Bai:
Conditional Graph Entropy as an Alternating Minimization Problem. 904-919 - Galen Reeves, Henry D. Pfister:
Reed-Muller Codes on BMS Channels Achieve Vanishing Bit-Error Probability for all Rates Below Capacity. 920-949 - Sebastian Heri, Julia Lieb, Joachim Rosenthal:
Self-Dual Convolutional Codes. 950-963 - Shuche Wang, Yuanyuan Tang, Jin Sima, Ryan Gabrys, Farzad Farnoud:
Non-Binary Codes for Correcting a Burst of at Most t Deletions. 964-979 - Jiongyue Xing, Martin Bossert, Li Chen, Jiasheng Yuan, Sebastian Bitzer:
Shift-Sum Decoding of Non-Binary Cyclic Codes. 980-994 - Yang Xu, Haibin Kan, Guangyue Han:
MacWilliams Extension Property With Respect to Weighted Poset Metric. 995-1007 - Yihan Zhang, Shashank Vatedka:
Multiple Packing: Lower Bounds via Error Exponents. 1008-1039 - Silas Richelson, Sourya Roy:
Analyzing Ta-Shma's Code via the Expander Mixing Lemma. 1040-1049 - Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
The Levenshtein's Sequence Reconstruction Problem and the Length of the List. 1050-1066 - Guodong Li, Min Ye, Sihuang Hu:
ABS+ Polar Codes: Exploiting More Linear Transforms on Adjacent Bits. 1067-1086 - Ali Gholami, Kai Wan, Hua Sun, Mingyue Ji, Giuseppe Caire:
Coded Caching With Private Demands and Caches. 1087-1106 - Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Ideal-Theoretic Explanation of Capacity-Achieving Decoding. 1107-1123 - Mehrasa Ahmadipour, Mari Kobayashi, Michèle A. Wigger, Giuseppe Caire:
An Information-Theoretic Approach to Joint Sensing and Communication. 1124-1146 - Kamyar Moshksar:
On a Class of Time-Varying Gaussian ISI Channels. 1147-1166 - Tong Zhang, Shuai Wang, Yinfei Xu, Rui Wang, P. C. Ching, H. Vincent Poor:
The Generalized Degrees-of-Freedom Region of the Two-User MIMO Broadcast Channel With Delayed CSIT. 1167-1177 - Shubhanshu Shekhar, Aaditya Ramdas:
Nonparametric Two-Sample Testing by Betting. 1178-1203 - Ioannis Kontoyiannis:
Context-Tree Weighting and Bayesian Context Trees: Asymptotic and Non-Asymptotic Justifications. 1204-1219 - Suya Wu, Enmao Diao, Taposh Banerjee, Jie Ding, Vahid Tarokh:
Quickest Change Detection for Unnormalized Statistical Models. 1220-1232 - Sreejith Sreekumar, Ziv Goldfeld, Kengo Kato:
Limit Distribution Theory for f-Divergences. 1233-1267 - Dionissios T. Hristopulos:
Non-Separable Covariance Kernels for Spatiotemporal Gaussian Processes Based on a Hybrid Spectral Method and the Harmonic Oscillator. 1268-1283 - Payam Delgosha, Hamed Hassani, Ramtin Pedarsani:
Binary Classification Under ℓ0 Attacks for General Noise Distribution. 1284-1299 - Meng Zhang, Ermin Wei, Randall Berry, Jianwei Huang:
Age-Dependent Differential Privacy. 1300-1319 - Sajani Vithana, Sennur Ulukus:
Private Read Update Write (PRUW) in Federated Submodel Learning (FSL): Communication Efficient Schemes With and Without Sparsification. 1320-1348 - Gowtham R. Kurri, Lalitha Sankar, Oliver Kosut:
An Operational Approach to Information Leakage via Generalized Gain Functions. 1349-1375 - Yizhou Zhao, Hua Sun:
Secure Summation: Capacity Region, Groupwise Key, and Feasibility. 1376-1387 - Dror Chawin, Ishay Haviv:
Hardness of Linear Index Coding on Perturbed Instances. 1388-1396 - Xubin Hu, Lingfei Jin, Liming Ma, Chaoping Xing:
Binary Sequences With a Low Correlation via Cyclotomic Function Fields of Odd Characteristic. 1397-1407 - Jihye Jeong, Yoonjin Lee:
Algorithms for Constructing Balanced Plateaued Functions With Maximal Algebraic Degrees. 1408-1421 - Cheng Du, Yi Jiang:
Polyphase Golay Complementary Arrays: The Possible Sizes and New Constructions. 1422-1435 - Kangquan Li, Nikolay S. Kaleyski:
Two New Infinite Families of APN Functions in Trivariate Form. 1436-1452 - Namiko Matsumoto, Arya Mazumdar, Soumyabrata Pal:
Improved Support Recovery in Universal 1-bit Compressed Sensing. 1453-1472 - Alankrita Bhatt, Ziao Wang, Chi Wang, Lele Wang:
Universal Graph Compression: Stochastic Block Models. 1473-1497 - P. Charantej Reddy, Aditya Siripuram, Brad Osgood:
Fast DFT Computation for Signals With Structured Support. 1498-1524
Volume 70, Number 3, March 2024
- Millen Kanabar, Jonathan Scarlett:
Mismatched Rate-Distortion Theory: Ensembles, Bounds, and General Alphabets. 1525-1539 - Shlomi Agmon:
Root Tracking for Rate-Distortion: Approximating a Solution Curve With Higher Implicit Multivariate Derivatives. 1540-1587 - Maël Le Treust, Tobias J. Oechtering:
Power-Estimation Trade-Off of Vector-Valued Witsenhausen Counterexample With Causal Decoder. 1588-1609 - Eli Shemuel, Oron Sabag, Haim H. Permuter:
Finite-State Channels With Feedback and State Known at the Encoder. 1610-1628 - Farhad Shirani, S. Sandeep Pradhan:
A Structured Coding Framework for Communication and Computation Over Continuous Networks. 1629-1651 - Dor Tsur, Ziv Aharoni, Ziv Goldfeld, Haim H. Permuter:
Data-Driven Optimization of Directed Information Over Discrete Alphabets. 1652-1670 - Paolo Perrone:
Markov Categories and Entropy. 1671-1692 - Omar Fawzi, Paul Fermé:
Multiple-Access Channel Coding With Non-Signaling Correlations. 1693-1719 - Mustapha Hamad, Michèle A. Wigger, Mireille Sarkiss:
Strong Converses Using Typical Changes of Measures and Asymptotic Markov Chains. 1720-1737 - Min Xu, Zixiang Xu, Gennian Ge, Min-Qian Liu:
A Rainbow Framework for Coded Caching and Its Applications. 1738-1752 - Fernando Piñero-González, Doel Rivera Laboy:
Fundamental Results on a Class of Affine Polar Grassmann Codes and Their Duals. 1753-1773 - Kohtaro Watanabe, Motonari Ohtsuka, Yuta Tsukie:
ADMM and Reproducing Sum-Product Decoding Algorithm Applied to QC-MDPC Code-Based McEliece Cryptosystems. 1774-1786 - K. K. Krishnan Namboodiri, B. Sundar Rajan:
Combinatorial Multi-Access Coded Caching: Improved Rate-Memory Trade-Off With Coded Placement. 1787-1805 - Weijun Fang, Jingjie Lv, Bin Chen, Shu-Tao Xia, Xiangyu Chen:
New Constructions of MDS Array Codes and Optimal Locally Repairable Array Codes. 1806-1822 - Zhao Hu, Yunge Xu, Nian Li, Xiangyong Zeng, Lisha Wang, Xiaohu Tang:
New Constructions of Optimal Linear Codes From Simplicial Complexes. 1823-1835 - Ciyuan Zhang, Su Wang, Vaneet Aggarwal, Borja Peleato:
Coded Caching With Heterogeneous User Profiles. 1836-1847 - Milan S. Derpich, Jan Østergaard:
Comments on "Feedback Capacity of Stationary Gaussian Channels". 1848-1851 - Shenghao Yang, Jun Ma, Yanxiao Liu:
Wireless Network Scheduling With Discrete Propagation Delays: Theorems and Algorithms. 1852-1875 - Shima Bab Hadiashar, Ashwin Nayak, Pulkit Sinha:
Optimal Lower Bounds for Quantum Learning via Information Theory. 1876-1896 - Seonho Kim, Sohail Bahmani, Kiryung Lee:
Max-Linear Regression by Convex Programming. 1897-1912 - Qian Yu, Yury Polyanskiy:
Ising Model on Locally Tree-Like Graphs: Uniqueness of Solutions to Cavity Equations. 1913-1938 - Jayadev Acharya, Clément L. Canonne, Aditya Vikram Singh, Himanshu Tyagi:
Optimal Rates for Nonparametric Density Estimation Under Communication Constraints. 1939-1961 - Chong Deng, Xin-Jian Xu, Shihui Ying:
Strong Consistency of Spectral Clustering for the Sparse Degree-Corrected Hypergraph Stochastic Block Model. 1962-1977 - Sean O'Rourke, Van Vu, Ke Wang:
Matrices With Gaussian Noise: Optimal Estimates for Singular Subspace Perturbation. 1978-2002 - Junren Chen, Michael K. Ng, Di Wang:
Quantizing Heavy-Tailed Data in Statistical Estimation: (Near) Minimax Rates, Covariate Quantization, and Uniform Recovery. 2003-2038 - Junhyung Ahn, Adel M. Elmahdy, Soheil Mohajer, Changho Suh:
On the Fundamental Limits of Matrix Completion: Leveraging Hierarchical Similarity Graphs. 2039-2075 - Doyeon Kim, Jeonghwan Lee, Hye Won Chung:
A Worker-Task Specialization Model for Crowdsourcing: Efficient Inference and Fundamental Limits. 2076-2117 - Yufan Li, Zhou Fan, Subhabrata Sen, Yihong Wu:
Random Linear Estimation With Rotationally-Invariant Designs: Asymptotics at High Temperature. 2118-2153 - Yasong Feng, Zengfeng Huang, Tianyu Wang:
Lipschitz Bandits With Batched Feedback. 2154-2176 - Amirreza Zamani, Tobias J. Oechtering, Mikael Skoglund:
On the Privacy-Utility Trade-Off With and Without Direct Access to the Private Data. 2177-2200 - Palash Sarkar, Chunlei Li, Sudhan Majhi, Zilong Liu:
New Correlation Bound and Construction of Quasi-Complementary Sequence Sets. 2201-2223 - P. Vijay Kumar, Dileep Dharmappa, Sugandh Mishra:
Interleaved Z4-Linear Sequences With Low Correlation for Global Navigation Satellite Systems. 2224-2253 - Paolo Santini, Marco Baldi, Franco Chiaraluce:
Computational Hardness of the Permuted Kernel and Subcode Equivalence Problems. 2254-2270 - Loïc Bidoux, Pierre Briaud, Maxime Bros, Philippe Gaborit:
RQC Revisited and More Cryptanalysis for Rank-Based Cryptography. 2271-2286
Volume 70, Number 4, April 2024
- Lei Yu, Venkat Anantharam, Jun Chen:
Graphs of Joint Types, Noninteractive Simulation, and Stronger Hypercontractivity. 2287-2308 - Neha Sangwan, Mayank Bakshi, Bikash Kumar Dey, Vinod M. Prabhakaran:
Byzantine Multiple Access Channels - Part I: Reliable Communication. 2309-2366 - Recep Can Yavas, Victoria Kostina, Michelle Effros:
Variable-Length Sparse Feedback Codes for Point-to-Point, Multiple Access, and Random Access Channels. 2367-2394 - Qin Huang, Bin Zhang:
Derivative Descendants of Cyclic Codes and Derivative Decoding. 2395-2410 - Zhonghua Sun, Chengju Li, Cunsheng Ding:
An Infinite Family of Binary Cyclic Codes With Best Parameters. 2411-2418 - Massimo Battaglioni, Marco Baldi, Franco Chiaraluce:
Bounds on the Free Distance of Periodically Time-Varying SC-LDPC Codes. 2419-2429 - Yujie Gu, Ilya Vorobyev, Ying Miao:
Secure Codes With List Decoding. 2430-2442 - Heide Gluesing-Luerssen, Alberto Ravagnani:
ℓ-Complementary Subspaces and Codes in Finite Bilinear Spaces. 2443-2455 - Adele A. Rescigno, Ugo Vaccaro:
Improved Algorithms and Bounds for List Union-Free Families. 2456-2463 - Zhou Li, Hua Sun:
On Extremal Rates of Storage Over Graphs. 2464-2478 - Simon R. Blackburn, Navid Nasr Esfahani, Donald L. Kreher, Douglas R. Stinson:
Constructions and Bounds for Codes With Restricted Overlaps. 2479-2490 - Pål Anders Floor, Tor A. Ramstad:
Shannon-Kotel'nikov Mappings for Analog Point-to-Point Communications. 2491-2517 - Hadi Reisizadeh, Mohammad Ali Maddah-Ali, Soheil Mohajer:
Cache-Aided K-User Broadcast Channels With State Information at Receivers. 2518-2537 - Emanuele Parrinello, Antonio Bazco Nogueras, Petros Elia:
Fundamental Limits of Topology-Aware Shared-Cache Networks. 2538-2565 - Zheyu Wu, Junjie Ma, Ya-Feng Liu, A. Lee Swindlehurst:
Asymptotic SEP Analysis and Optimization of Linear-Quantized Precoding in Massive MIMO Systems. 2566-2589 - Aditya Nema, Pranab Sen:
High Probability Decoupling via Approximate Unitary Designs and Efficient Relative Thermalization. 2590-2616 - Bjarne Berg, Nilanjana Datta, Robert Salzmann, Mark M. Wilde:
Parallelization of Adaptive Quantum Channel Discrimination in the Non-Asymptotic Regime. 2617-2636 - Piotr Dulian, Adam Sawicki:
A Random Matrix Model for Random Approximate t-Designs. 2637-2654 - Paula Belzig, Matthias Christandl, Alexander Müller-Hermes:
Fault-Tolerant Coding for Entanglement-Assisted Communication. 2655-2673 - Milán Mosonyi, Fumio Hiai:
Some Continuity Properties of Quantum Rényi Divergences. 2674-2700 - Itamar Katz, Alex Samorodnitsky, Yuval Kochman:
Optimal Discrimination Between Two Pure States and Dolinar-Type Coherent-State Detection. 2701-2712 - Michele Dall'Arno:
On the Measurement Attaining the Quantum Guesswork. 2713-2719 - Qisheng Wang, Zhicheng Zhang:
Fast Quantum Algorithms for Trace Distance Estimation. 2720-2733 - Christophe Piveteau, David Sutter:
Circuit Knitting With Classical Communication. 2734-2745 - Robert A. Vandermeulen, René Saitenmacher:
Generalized Identifiability Bounds for Mixture Models With Grouped Samples. 2746-2758 - Jian Li, Yong Liu, Weiping Wang:
Optimal Rates for Agnostic Distributed Learning. 2759-2778 - Prathamesh Mayekar, Shubham K. Jha, Ananda Theertha Suresh, Himanshu Tyagi:
Wyner-Ziv Estimators for Distributed Mean Estimation With Side Information and Optimization. 2779-2806 - Arsalan Sharif-Nassab, Saber Salehkaleybar, S. Jamaloddin Golestani:
Order Optimal Bounds for One-Shot Federated Learning Over Non-Convex Loss Functions. 2807-2830 - Avishek Ghosh, Abishek Sankararaman, Kannan Ramchandran, Tara Javidi, Arya Mazumdar:
Competing Bandits in Non-Stationary Matching Markets. 2831-2850 - Rémi A. Chou:
Distributed Secret Sharing Over a Public Channel From Correlated Random Variables. 2851-2869 - Feng Ye, Xianghui Cao, Mo-Yuen Chow, Lin Cai:
Privacy-Preserving Average Consensus: Fundamental Analysis and a Generic Framework Design. 2870-2885 - Hassan ZivariFard, Rémi A. Chou:
Private Information Retrieval With Private Noisy Side Information. 2886-2902 - Zhusheng Wang, Sennur Ulukus:
Private Federated Submodel Learning via Private Set Union. 2903-2921 - Peng-Jun Wan, Pengpeng Chen:
Maximizing Weighted Sum-Rate Over Gaussian Broadcast Channels. 2922-2935 - Nouman Khan, Mehrdad Moharrami, Vijay G. Subramanian:
Rarest-First With Probabilistic-Mode-Suppression (RFwPMS). 2936-2966 - Yunseok Lee, Holger Boche, Gitta Kutyniok:
Computability of Optimizers. 2967-2983 - Oriol Farràs, Jordi Ribes-González:
One-Out-of-q OT Combiners. 2984-2998 - Minoh Jeong, Alex Dytso, Martina Cardone:
Retrieving Data Permutations From Noisy Observations: Asymptotics. 2999-3017 - Yuval Bistritz, Idan Dekel:
Integer Levinson Algorithm for the Inversion of Any Nonsingular Hermitian Toeplitz Matrix. 3018-3031 - Guangyang Zeng, Biqiang Mu, Ling Shi, Jiming Chen, Junfeng Wu:
Consistent and Asymptotically Efficient Localization From Range- Difference Measurements. 3032-3045 - Masahito Hayashi, Vincent Y. F. Tan:
Corrections to "Equivocations, Exponents, and Second-Order Coding Rates Under Various Rényi Information Measures". 3046-3048
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-30 20:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
