default search action
IEEE Transactions on Information Theory, Volume 68
Volume 68, Number 1, January 2022
- Mohammad J. Salariseddigh, Uzi Pereg, Holger Boche, Christian Deppe:
Deterministic Identification Over Channels With Power Constraints. 1-24 - Shun Watanabe:
Minimax Converse for Identification via Channels. 25-34 - Alireza Tasdighi, Emmanuel Boutillon:
Integer Ring Sieve for Constructing Compact QC-LDPC Codes With Girths 8, 10, and 12. 35-46 - Elad Domanovitz, Silas L. Fong, Ashish Khisti:
An Explicit Rate-Optimal Streaming Code for Channels With Burst and Arbitrary Erasures. 47-65 - Kui Cai, Han Mao Kiah, Tuan Thanh Nguyen, Eitan Yaakobi:
Coding for Sequence Reconstruction for Single Edits. 66-79 - Suihua Cai, Shancheng Zhao, Xiao Ma:
Free Ride on LDPC Coded Transmission. 80-92 - Xuan He, Kui Cai, Liang Zhou:
A Class of Optimal Structures for Node Computations in Message Passing Algorithms. 93-104 - Hongwei Liu, Xu Pan:
Generalized Pair Weights of Linear Codes and Linear Isomorphisms Preserving Pair Weights. 105-117 - Hengjia Wei, Moshe Schwartz:
Improved Coding Over Sets for DNA-Based Data Storage. 118-129 - Spencer Congero, Kenneth Zeger:
Hexagonal Run-Length Zero Capacity Region - Part I: Analytical Proofs. 130-152 - Spencer Congero, Kenneth Zeger:
Hexagonal Run-Length Zero Capacity Region - Part II: Automated Proofs. 153-177 - Patrick Schulte, Rana Ali Amjad, Thomas Wiegart, Gerhard Kramer:
Invertible Low-Divergence Coding. 178-192 - Hengjia Wei:
Nearly Optimal Robust Positioning Patterns. 193-203 - Han Cai, Ying Miao, Moshe Schwartz, Xiaohu Tang:
A Construction of Maximally Recoverable Codes With Order-Optimal Field Size. 204-212 - Pavel Panteleev, Gleb Kalachev:
Quantum LDPC Codes With Almost Linear Minimum Distance. 213-229 - Daitao Huang, Qin Yue:
Extended Irreducible Binary Sextic Goppa Codes. 230-237 - Siddharth Bhandari, Jaikumar Radhakrishnan:
Bounds on the Zero-Error List-Decoding Capacity of the q/(q - 1) Channel. 238-247 - Antonio Bazco Nogueras, Paul de Kerret, David Gesbert, Nicolas Gresset:
Asymptotically Achieving Centralized Rate on the Decentralized Network MISO Channel. 248-271 - Nikolas P. Breuckmann, Vivien Londe:
Single-Shot Decoding of Linear Rate LDPC Quantum Codes With High Performance. 272-286 - Nicolas Delfosse, Ben W. Reichardt, Krysta M. Svore:
Beyond Single-Shot Fault-Tolerant Quantum Error Correction. 287-301 - Xiaodie Lin, Zhaohui Wei, Penghui Yao:
Quantum and Classical Hybrid Generations for Classical Correlations. 302-310 - Christopher Perry, Péter Vrana, Albert H. Werner:
The Semiring of Dichotomies and Asymptotic Relative Submajorization. 311-321 - Eric P. Hanson, Vishal Katariya, Nilanjana Datta, Mark M. Wilde:
Guesswork With Quantum Side Information. 322-338 - Samad Khabbazi Oskouei, Stefano Mancini, Andreas J. Winter:
Capacities of Gaussian Quantum Channels With Passive Environment Assistance. 339-358 - Uzi Pereg:
Communication Over Quantum Channels With Parameter Estimation. 359-383 - Salman Beigi, Marc-Olivier Renou:
Covariance Decomposition as a Universal Limit on Correlations in Networks. 384-394 - Wei Qian, Yuqian Zhang, Yudong Chen:
Structures of Spurious Local Minima in k-Means. 395-422 - Ery Arias-Castro, Lin Zheng:
Template Matching and Change Point Detection by M-Estimation. 423-447 - Gen Li, Yuting Wei, Yuejie Chi, Yuantao Gu, Yuxin Chen:
Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction. 448-473 - Sharu Theresa Jose, Osvaldo Simeone, Giuseppe Durisi:
Transfer Meta-Learning: Information- Theoretic Bounds and Information Meta-Risk Minimization. 474-501 - Jayadev Acharya, Clément L. Canonne, Yuhan Liu, Ziteng Sun, Himanshu Tyagi:
Interactive Inference Under Information Constraints. 502-516 - Lukas Holzbaur, Ragnar Freij-Hollanti, Jie Li, Camilla Hollanti:
Toward the Capacity of Private Information Retrieval From Coded and Colluding Servers. 517-537 - Tobias Edwards, Benjamin I. P. Rubinstein, Zuhe Zhang, Sanming Zhou:
A Graph Symmetrization Bound on Channel Information Leakage Under Blowfish Privacy. 538-548 - Vidhi Rana, Rémi A. Chou, Hyuck M. Kwon:
Information-Theoretic Secret Sharing From Correlated Gaussian Random Variables and Public Communication. 549-559 - Randall Dougherty, R. Daniel Mauldin, Mark Tiefenbruck:
The Covering Radius of the Reed-Muller Code RM(m - 4, m) in RM(m - 3, m). 560-571 - Saad Kriouile, Mohamad Assaad, Ali Maatouk:
On the Global Optimality of Whittle's Index Policy for Minimizing the Age of Information. 572-600 - Qi Chen, Chunming Tang, Zhiqiang Lin:
Efficient Explicit Constructions of Multipartite Secret Sharing Schemes. 601-631 - Alain Couvreur, Matthieu Lequesne:
On the Security of Subspace Subcodes of Reed-Solomon Codes for Public Key Encryption. 632-648 - Ming Li, Dongdai Lin:
The Adjacency Graphs of FSRs With Affine Characteristic Functions. 649-658 - Jian Ding, Changlu Lin, Huaxiong Wang, Chaoping Xing:
Communication Efficient Secret Sharing With Small Share Size. 659-669 - Christof Beierle, Gregor Leander:
New Instances of Quadratic APN Functions. 670-678 - Sartaj Ul Hasan, Mohit Pal, Pantelimon Stanica:
The c-Differential Uniformity and Boomerang Uniformity of Two Classes of Permutation Polynomials. 679-691 - Peihua Li, Cuiling Fan, Sihem Mesnager, Yang Yang, Zhengchun Zhou:
Constructions of Optimal Uniform Wide-Gap Frequency-Hopping Sequences. 692-700
Volume 68, Number 2, February 2022
- Amin Gohari, Chandra Nair:
Outer Bounds for Multiuser Settings: The Auxiliary Receiver Approach. 701-736 - Neri Merhav:
On More General Distributions of Random Binning for Slepian-Wolf Encoding. 737-751 - Rishabh K. Iyer, Ninad Khargonkar, Jeff A. Bilmes, Himanshu Asnani:
Generalized Submodular Information Measures: Theoretical Properties, Examples, Optimization Algorithms, and Applications. 752-781 - Guangyue Han, Shlomo Shamai:
On Sampling Continuous-Time AWGN Channels. 782-794 - Prasant Singh:
Majority Logic Decoding for Certain Schubert Codes Using Lines in Schubert Varieties. 795-805 - Kai Wan, Daniela Tuninetti, Mingyue Ji, Pablo Piantanida:
Combination Networks With End-User-Caches: Novel Achievable and Converse Bounds Under Uncoded Cache Placement. 806-827 - Maria Bras-Amorós, Alonso Sepúlveda Castellanos, Luciane Quoos:
The Isometry-Dual Property in Flags of Two-Point Algebraic Geometry Codes. 828-838 - Mohammad Nassar, Eitan Yaakobi:
Array Codes for Functional PIR and Batch Codes. 839-862 - Ethan Mook, Chris Peikert:
Lattice (List) Decoding Near Minkowski's Inequality. 863-870 - Yuanyuan Tang, Farzad Farnoud:
Error-Correcting Codes for Short Tandem Duplication and Edit Errors. 871-880 - Tamás Héger, Zoltán Lóránt Nagy:
Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces. 881-890 - Tuvi Etzion:
Non-Binary Diameter Perfect Constant-Weight Codes. 891-904 - Venkatesan Guruswami, Jonathan Moshieff, Nicolas Resch, Shashwat Silas, Mary Wootters:
Threshold Rates for Properties of Random Codes. 905-922 - Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters:
Bounds for List-Decoding and List-Recovery of Random Linear Codes. 923-939 - Sihem Mesnager, Alexey Oblaukhov:
Classification of the Codewords of Weights 16 and 18 of the Reed-Muller Code RM(n-3, n). 940-952 - Binkai Gong, Cunsheng Ding, Chengju Li:
The Dual Codes of Several Classes of BCH Codes. 953-964 - Yukang Jiang, Naoto Miyoshi:
Joint Performance Analysis of Ages of Information in a Multi-Source Pushout Server. 965-975 - Farzin Salek, Andreas J. Winter:
Multi-User Distillation of Common Randomness and Entanglement From Quantum States. 976-988 - Michal Oszmaniec, Adam Sawicki, Michal Horodecki:
Epsilon-Nets, Unitary Designs, and Random Quantum Circuits. 989-1015 - Toyohiro Tsurumaru:
Equivalence of Three Classical Algorithms With Quantum Side Information: Privacy Amplification, Error Correction, and Data Compression. 1016-1031 - Milán Mosonyi, Zsombor Szilágyi, Mihály Weiner:
On the Error Exponents of Binary State Discrimination With Composite Hypotheses. 1032-1067 - Lisa Hänggli, Robert König:
Oscillator-to-Oscillator Codes Do Not Have a Threshold. 1068-1084 - Touheed Anwar Atif, Mohsen Heidari, S. Sandeep Pradhan:
Faithful Simulation of Distributed Quantum Measurements With Applications in Distributed Rate-Distortion Theory. 1085-1118 - Inés Armendáriz, Pablo A. Ferrari, Daniel Fraiman, José Mario Martínez, Silvina Ponce Dawson:
Group Testing With Nested Pools. 1119-1132 - Álvaro Gajardo, Hans-Georg Müller:
Cox Point Process Regression. 1133-1156 - Michael P. Friedlander, Halyun Jeong, Yaniv Plan, Özgür Yilmaz:
NBIHT: An Efficient Algorithm for 1-Bit Compressed Sensing With Optimal Error Decay Rate. 1157-1177 - Luc Devroye, László Györfi:
On the Consistency of the Kozachenko-Leonenko Entropy Estimate. 1178-1185 - Seung-Hyun Nam, Si-Hyeon Lee:
Secrecy Capacity of a Gaussian Wiretap Channel With ADCs is Always Positive. 1186-1196 - Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat, Eitan Yaakobi:
Multi-Server Weakly-Private Information Retrieval. 1197-1219 - Yuhao Yi, Bingjia Yang, Zuobai Zhang, Zhongzhi Zhang, Stacy Patterson:
Biharmonic Distance-Based Performance Metric for Second-Order Noisy Consensus Networks. 1220-1236 - Yifeng Xiong, Nan Wu, Yuan Shen, Moe Z. Win:
Cooperative Localization in Massive Networks. 1237-1258 - Kai Wan, Hua Sun, Mingyue Ji, Giuseppe Caire:
Distributed Linearly Separable Computation. 1259-1278 - Pei Peng, Emina Soljanin, Philip Whiting:
Diversity/Parallelism Trade-Off in Distributed Systems With Redundancy. 1279-1295 - Tomer Ashur, Mohsin Khan, Kaisa Nyberg:
Structural and Statistical Analysis of Multidimensional Linear Approximations of Random Functions and Permutations. 1296-1315 - Jun Che, Chengliang Tian, Yupeng Jiang, Guangwu Xu:
Algorithms for the Minimal Rational Fraction Representation of Sequences Revisited. 1316-1328 - Jing Yang, Qian Guo, Thomas Johansson, Michael Lentmaier:
Revisiting the Concrete Security of Goldreich's Pseudorandom Generator. 1329-1354 - Claude Carlet:
A Wide Class of Boolean Functions Generalizing the Hidden Weight Bit Function. 1355-1368 - Erixhen Sula, Michael Gastpar:
The Gray-Wyner Network and Wyner's Common Information for Gaussian Sources. 1369-1384 - Ting Chen, Wenchang Sun:
Linear Phaseless Retrieval of Functions in Spline Spaces With Arbitrary Knots. 1385-1396 - Namrata Vaswani:
Corrections to "Provable Low Rank Phase Retrieval". 1397-1400
Volume 68, Number 3, March 2022
- Akbar Ghasemi, Abolfazl Seyed Motahari, Amir Keyvan Khandani:
Interference Alignment for the K-User MIMO Interference Channel. 1401-1411 - Payam Delgosha, Venkat Anantharam:
Distributed Compression of Graphical Data. 1412-1439 - Charalambos D. Charalambous, Themistoklis Charalambous, Christos K. Kourtellaris, Jan H. van Schuppen:
Complete Characterization of Gorbunov and Pinsker Nonanticipatory Epsilon Entropy of Multivariate Gaussian Sources: Structural Properties. 1440-1464 - Chengyu Wu, Guangyue Han, Venkat Anantharam, Brian H. Marcus:
A Deterministic Algorithm for the Capacity of Finite-State Channels. 1465-1479 - Or Ordentlich, Yury Polyanskiy:
Strong Data Processing Constant Is Achieved by Binary Inputs. 1480-1481 - Marco Bondaschi, Albert Guillén i Fàbregas, Marco Dalai:
Mismatched Decoding Reliability Function at Zero Rate. 1482-1495 - Yuta Sakai, Vincent Y. F. Tan:
On Smooth Rényi Entropies: A Novel Information Measure, One-Shot Coding Theorems, and Asymptotic Expansions. 1496-1531 - Neri Merhav:
Finite-State Source-Channel Coding for Individual Source Sequences With Source Side Information at the Decoder. 1532-1544 - Ago-Erik Riet, Vitaly Skachek, Eldho K. Thomas:
Batch Codes for Asynchronous Recovery of Data. 1545-1559 - Tal Shinkar, Eitan Yaakobi, Andreas Lenz, Antonia Wachter-Zeh:
Clustering-Correcting Codes. 1560-1580 - Ron M. Roth:
Asymptotic Bounds on the Rate of Locally Repairable Codes. 1581-1598 - Yeow Meng Chee, Michal Horovitz, Alexander Vardy, Van Khu Vu, Eitan Yaakobi:
Endurance-Limited Memories: Capacity and Codes. 1599-1613 - Mohannad Shehadeh, Frank R. Kschischang:
Space-Time Codes From Sum-Rank Codes. 1614-1637 - Mladen Kovacevic, Dejan Vukobratovic:
Asymptotic Behavior and Typicality Properties of Runlength-Limited Sequences. 1638-1650 - Hiram H. López, Gretchen L. Matthews, Daniel Valvo:
Erasures Repair for Decreasing Monomial-Cartesian and Augmented Reed-Muller Codes of High Rate. 1651-1662 - Zeyu Guo, Noga Ron-Zewi:
Efficient List-Decoding With Constant Alphabet and List Sizes. 1663-1682 - Hongwei Zhu, Minjia Shi, Xiaoqiang Wang, Tor Helleseth:
The q-Ary Antiprimitive BCH Codes. 1683-1695 - Zhilin Chen, Foad Sohrabi, Ya-Feng Liu, Wei Yu:
Phase Transition Analysis for Covariance-Based Massive Random Access With Massive MIMO. 1696-1715 - Recep Gül, David Stotz, Syed Ali Jafar, Helmut Bölcskei, Shlomo Shamai Shitz:
Canonical Conditions for K/2 Degrees of Freedom. 1716-1730 - Ertan Kazikli, Serkan Saritas, Sinan Gezici, Tamás Linder, Serdar Yüksel:
Signaling Games for Log-Concave Distributions: Number of Bins and Properties of Equilibria. 1731-1757 - Anurag Anshu, Debbie W. Leung, Dave Touchette:
Incompressibility of Classical Distributions. 1758-1771 - Simon Burton, Dan E. Browne:
Limitations on Transversal Gates for Hypergraph Product Codes. 1772-1781 - Rémi A. Chou:
Private Classical Communication Over Quantum Multiple-Access Channels. 1782-1794 - Jingzhen Hu, Qingzhong Liang, Narayanan Rengaswamy, A. Robert Calderbank:
Mitigating Coherent Noise by Balancing Weight-2 Z-Stabilizers. 1795-1808 - Yingkai Ouyang, Nathan Shettell, Damian Markham:
Robust Quantum Metrology With Explicit Symmetric States. 1809-1821 - Masahito Hayashi, Ning Cai:
Universal Classical-Quantum Superposition Coding and Universal Classical-Quantum Multiple Access Channel Coding. 1822-1850 - Avishek Ghosh, Ashwin Pananjady, Adityanand Guntuboyina, Kannan Ramchandran:
Max-Affine Regression: Parameter Estimation for Gaussian Designs. 1851-1885 - Nir Weinberger:
Generalization Bounds and Algorithms for Learning to Communicate Over Additive Noise Channels. 1886-1921 - Oscar Hernan Madrid Padilla, Yi Yu, Daren Wang, Alessandro Rinaldo:
Optimal Nonparametric Multivariate Change Point Detection and Localization. 1922-1944 - Emre Ozfatura, Sennur Ulukus, Deniz Gündüz:
Coded Distributed Computing With Partial Recovery. 1945-1959 - Mohamed Ndaoud, Suzanne Sigalla, Alexandre B. Tsybakov:
Improved Clustering Algorithms for the Bipartite Stochastic Block Model. 1960-1975 - Lee-Ad Gottlieb, Eran Kaufman, Aryeh Kontorovich, Gabriel Nivasch:
Learning Convex Polyhedra With Margin. 1976-1984 - Alex Dytso, Michael Fauß, H. Vincent Poor:
Bayesian Risk With Bregman Loss: A Cramér-Rao Type Bound and Linear Estimation. 1985-2000 - Zhusheng Wang, Karim Banawan, Sennur Ulukus:
Private Set Intersection: A Multi-Message Symmetric Private Information Retrieval Perspective. 2001-2019 - Varun Narayanan, Jithin Ravi, Vivek K. Mishra, Bikash Kumar Dey, Nikhil Karamchandani, Vinod M. Prabhakaran:
Private Index Coding. 2020-2049 - Suayb S. Arslan:
Array BP-XOR Codes for Hierarchically Distributed Matrix Multiplication. 2050-2066 - Zilong Wang, Erzhong Xue, Guang Gong:
New Constructions of Complementary Sequence Pairs Over 4q-QAM. 2067-2082 - Amos Beimel, Oriol Farràs, Yuval Mintz, Naty Peter:
Linear Secret-Sharing Schemes for Forbidden Graph Access Structures. 2083-2100
Volume 68, Number 4, April 2022
- Ronit Bustin, Ofer Shayevitz:
On Lossy Compression of Directed Graphs. 2101-2122 - James Melbourne, Saurav Talukdar, Shreyas Bhaban, Mokshay Madiman, Murti V. Salapaka:
The Differential Entropy of Mixtures: New Bounds and Applications. 2123-2146 - Daniel E. Clark:
A Cramér Rao Bound for Point Processes. 2147-2155 - Ran Tamir, Neri Merhav:
Universal Decoding for the Typical Random Code and for the Expurgated Code. 2156-2168 - Michael G. Jabbour, Nilanjana Datta:
A Tight Uniform Continuity Bound for the Arimoto-Rényi Conditional Entropy and its Extension to Classical-Quantum States. 2169-2181 - Xuecheng Liu, Luoyi Fu, Xinbing Wang, Chenghu Zhou:
On the Similarity Between von Neumann Graph Entropy and Structural Information: Interpretation, Computation, and Applications. 2182-2202 - Lingfei Jin, Haibin Kan, Yuan Luo, Wenqing Zhang:
Binary Locally Repairable Codes With Large Availability and its Application to Private Information Retrieval. 2203-2210 - Mert Pilanci:
Computational Polarization: An Information-Theoretic Method for Resilient Computing. 2211-2238 - Ido Tal, Henry D. Pfister, Arman Fazeli, Alexander Vardy:
Polar Codes for the Deletion Channel: Weak and Strong Polarization. 2239-2265 - Mao-Ching Chiu:
Nonbinary I-Polar Coded Modulation. 2266-2280 - Sascha Kurz, Sam Mattheus:
A Generalization of the Cylinder Conjecture for Divisible Codes. 2281-2289 - Alexey V. Lebedev, Vladimir S. Lebedev, Nikita Polyanskii:
Two-Stage Coding Over the Z-Channel. 2290-2299 - Yaron Shany, Amit Berman:
A Gröbner-Bases Approach to Syndrome-Based Fast Chase Decoding of Reed-Solomon Codes. 2300-2318 - Yang Xu, Haibin Kan, Guangyue Han:
Fourier-Reflexive Partitions Induced by Poset Metric. 2319-2330 - Eleftherios Lampiris, Antonio Bazco Nogueras, Petros Elia:
Resolving the Feedback Bottleneck of Multi-Antenna Coded Caching. 2331-2348 - Mahdi Soleymani, Hessam Mahdavifar:
Analog Subspace Coding: A New Approach to Coding for Non-Coherent Wireless Networks. 2349-2364 - I-Hsiang Wang, Yu-Chih Huang, Shih-Chun Lin:
Universal Feedback Gain for Modulo-Sum Computation Over the Erasure MAC. 2365-2383 - Vamsi K. Amalladinne, Asit Kumar Pradhan, Cynthia Rush, Jean-François Chamberland, Krishna R. Narayanan:
Unsourced Random Access With Coded Compressed Sensing: Integrating AMP and Belief Propagation. 2384-2409 - Yao-Chia Chan, Syed Ali Jafar:
Secure GDoF of the Z-Channel With Finite Precision CSIT: How Robust are Structured Codes? 2410-2428 - Jithin Ravi, Tobias Koch:
Scaling Laws for Gaussian Random Many-Access Channels. 2429-2459 - Milad Sefidgaran, Mansoor I. Yousefi:
Lower Bound on the Capacity of the Continuous-Space SSFM Model of Optical Fiber. 2460-2478 - Ali Tajer, Javad Heydari, H. Vincent Poor:
Active Sampling for the Quickest Detection of Markov Networks. 2479-2508 - Hang Zhang, Martin Slawski, Ping Li:
The Benefits of Diversity: Permutation Recovery in Unlabeled Sensing From Multiple Measurement Vectors. 2509-2529 - Santiago Mazuelas, Yuan Shen, Aritz Pérez:
Generalized Maximum Entropy for Supervised Classification. 2530-2550 - Xiongjun Zhang, Michael K. Ng:
Sparse Nonnegative Tensor Factorization and Completion With Noisy Observations. 2551-2572 - Aaron Berk, Yaniv Plan, Özgür Yilmaz:
On the Best Choice of Lasso Program Given Data Parameters. 2573-2603 - Oliver Gebhard, Oliver Johnson, Philipp Loick, Maurice Rolvien:
Improved Bounds for Noisy Group Testing With Constant Tests per Item. 2604-2621 - Akshayaa Magesh, Venugopal V. Veeravalli:
Decentralized Heterogeneous Multi-Player Multi-Armed Bandits With Non-Zero Rewards on Collisions. 2622-2634 - Sajani Vithana, Karim Banawan, Sennur Ulukus:
Semantic Private Information Retrieval. 2635-2652 - Rawad Bitar, Marvin Xhemrishi, Antonia Wachter-Zeh:
Adaptive Private Distributed Matrix Multiplication. 2653-2673 - Yasunari Hikima, Atsushi Iwasaki, Ken Umeno:
The Reference Distributions of Maurer's Universal Statistical Test and Its Improved Tests. 2674-2683 - Aditya Ramamoorthy, Li Tang:
Numerically Stable Coded Matrix Computations via Circulant and Rotation Matrix Embeddings. 2684-2703 - Jinbao Zhu, Qifa Yan, Xiaohu Tang, Songze Li:
Symmetric Private Polynomial Computation From Lagrange Encoding. 2704-2718 - Frédérique E. Oggier, Gilles Zémor:
Coding Constructions for Efficient Oblivious Transfer From Noisy Channels. 2719-2734 - Yanjun Li, Haibin Kan, Sihem Mesnager, Jie Peng, Chik How Tan, Lijing Zheng:
Generic Constructions of (Boolean and Vectorial) Bent Functions and Their Consequences. 2735-2751 - Shayan Aziznejad, Julien Fageot:
The Wavelet Compressibility of Compound Poisson Processes. 2752-2766 - Anatoly Khina, Arie Yeredor, Ram Zamir:
Monotonicity of the Trace-Inverse of Covariance Submatrices and Two-Sided Prediction. 2767-2781 - Jorge F. Silva, Pablo Piantanida:
On Universal D-Semifaithful Coding for Memoryless Sources With Infinite Alphabets. 2782-2800
Volume 68, Number 5, May 2022
- Anelia Somekh-Baruch:
A Single-Letter Upper Bound on the Mismatch Capacity via Multicast Transmission. 2801-2812 - Olivier Rioul:
Variations on a Theme by Massey. 2813-2828 - Marco Bondaschi, Marco Dalai:
A Revisitation of Low-Rate Bounds on the Reliability Function of Discrete Memoryless Channels for List Decoding. 2829-2838 - Samuel H. Florin, Matthew H. Ho, Zilin Jiang:
On the Binary Adder Channel With Complete Feedback, With an Application to Quantitative Group Testing. 2839-2856 - Xin Zhang, Shenghui Song:
Bias for the Trace of the Resolvent and Its Application on Non-Gaussian and Non-Centered MIMO Channels. 2857-2876 - Venkatesan Guruswami, Andrii Riazanov, Min Ye:
Arıkan Meets Shannon: Polar Codes With Near-Optimal Convergence to Channel Capacity. 2877-2919 - Roni Con, Amir Shpilka:
Improved Constructions of Coding Schemes for the Binary Deletion Channel and the Poisson Repeat Channel. 2920-2940 - Giuseppe Cotardo, Alberto Ravagnani:
Parameters of Codes for the Binary Asymmetric Channel. 2941-2950 - Vincent Corlay, Joseph J. Boutros, Philippe Ciblat, Loïc Brunel:
On the Decoding of Lattices Constructed via a Single Parity Check. 2951-2968 - Vincent Corlay, Joseph J. Boutros, Philippe Ciblat, Loïc Brunel:
Neural Network Approaches to Point Lattice Decoding. 2969-2989 - Makhan Maji, Sihem Mesnager, Santanu Sarkar, Kalyan Hansda:
On One-Dimensional Linear Minimal Codes Over Finite (Commutative) Rings. 2990-2998 - Roope Vehkalahti, Laura Luzzi:
The DMT of Real and Quaternionic Lattice Codes and DMT Classification of Division Algebra Codes. 2999-3013 - Ferruh Özbudak, Rumi Melih Pelen:
Two or Three Weight Linear Codes From Non-Weakly Regular Bent Functions. 3014-3027 - Bocong Chen, Guanghui Zhang:
Improved Singleton Bound on Insertion-Deletion Codes and Optimal Constructions. 3028-3033 - Tsung-Ching Lin, Chong-Dao Lee, Yaotsu Chang, Trieu-Kien Truong:
On Decoding Binary Quasi-Reversible BCH Codes. 3034-3046 - Peter Beelen, Sven Puchinger, Johan Rosenkilde:
Twisted Reed-Solomon Codes. 3047-3061 - Herivelto Martins Borges Filho, Gregory Duran Cunha:
Weierstrass Pure Gaps on Curves With Three Distinguished Points. 3062-3069 - Yansheng Wu, Chengju Li, Fu Xiao:
Quaternary Linear Codes and Related Binary Subfield Codes. 3070-3080 - Adway Patra, Alexander Barg:
Node Repair on Connected Graphs. 3081-3095 - Qi Liu, Cunsheng Ding, Sihem Mesnager, Chunming Tang, Vladimir D. Tonchev:
On Infinite Families of Narrow-Sense Antiprimitive BCH Codes Admitting 3-Transitive Automorphism Groups and Their Consequences. 3096-3107 - Kees A. Schouhamer Immink, Jos H. Weber:
A New Detection Method for Noisy Channels With Time-Varying Offset. 3108-3114 - Fei Shi, Yi Shen, Lin Chen, Xiande Zhang:
k-Uniform States in Heterogeneous Systems. 3115-3129 - Zahra Baghali Khanian, Andreas J. Winter:
General Mixed-State Quantum Data Compression With and Without Entanglement Assistance. 3130-3138 - Michele Dall'Arno, Francesco Buscemi, Takeshi Koshiba:
Guesswork of a Quantum Ensemble. 3139-3143 - Keegan Yao, Walter O. Krawec, Jiadong Zhu:
Quantum Sampling for Finite Key Rates in High Dimensional Quantum Cryptography. 3144-3163 - Kaushik Senthoor, Pradeep Kiran Sarvepalli:
Theory of Communication Efficient Quantum Secret Sharing. 3164-3186 - Nicolas Delfosse, Vivien Londe, Michael E. Beverland:
Toward a Union-Find Decoder for Quantum LDPC Codes. 3187-3199 - Yichen Huang:
Entanglement Dynamics From Random Product States: Deviation From Maximal Entanglement. 3200-3207 - Péter Vrana:
Asymptotic Continuity of Additive Entanglement Measures. 3208-3217 - Abram Magner, Mayank Baranwal, Alfred O. Hero III:
Fundamental Limits of Deep Graph Convolutional Networks for Graph Classification. 3218-3233 - Subhroshekhar Ghosh, Krishnakumar Balasubramanian, Xiaochuan Yang:
Fractal Gaussian Networks: A Sparse Random Graph Model Based on Gaussian Multiplicative Chaos. 3234-3252 - Oliver Gebhard, Max Hahn-Klimroth, Olaf Parczyk, Manuel Penschuck, Maurice Rolvien, Jonathan Scarlett, Nelvin Tan:
Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms. 3253-3280 - Jonathan Lacotte, Mert Pilanci:
Adaptive and Oblivious Randomized Subspace Methods for High-Dimensional Optimization: Sharp Analysis and Lower Bounds. 3281-3303 - Ruida Zhou, Chao Tian, Tie Liu:
Individually Conditional Individual Mutual Information Bound on Generalization Error. 3304-3316 - Ajaykrishnan Nageswaran, Prakash Narayan:
Distribution Privacy Under Function Recoverability. 3317-3339 - Bernard Teo, Jonathan Scarlett:
Noisy Adaptive Group Testing via Noisy Binary Search. 3340-3353 - Jonathan W. Siegel, Jinchao Xu:
Optimal Convergence Rates for the Orthogonal Greedy Algorithm. 3354-3361 - Guangcan Liu:
Time Series Forecasting via Learning Convolutionally Low-Rank Models. 3362-3380 - Dan Zhang, Tor Helleseth:
Sequences With Good Correlations Based on Circular Florentine Arrays. 3381-3388 - Lilya Budaghyan, Marco Calderini, Claude Carlet, Diana Davidova, Nikolay S. Kaleyski:
On Two Fundamental Problems on APN Power Functions. 3389-3403 - Claude Carlet, Pierrick Méaux:
A Complete Study of Two Classes of Boolean Functions: Direct Sums of Monomials and Threshold Functions. 3404-3425 - Thomas Debris-Alazard, Léo Ducas, Wessel P. J. van Woerden:
An Algorithmic Reduction Theory for Binary Codes: LLL and More. 3426-3444 - Lingfei Jin, Liming Ma, Chaoping Xing:
Binary Sequences With a Low Correlation via Cyclotomic Function Fields. 3445-3454 - Daniel J. Katz, Courtney M. van der Linden:
Peak Sidelobe Level and Peak Crosscorrelation of Golay-Rudin-Shapiro Sequences. 3455-3473 - Meysam Ghomi, Tamás Linder, Serdar Yüksel:
Zero-Delay Lossy Coding of Linear Vector Markov Sources: Optimality of Stationary Codes and Near Optimality of Finite Memory Codes. 3474-3488 - Tamir Bendory, Dan Edidin, William E. Leeb, Nir Sharon:
Dihedral Multi-Reference Alignment. 3489-3499 - Emmanuel Boutillon:
Corrections to "Optimization of Non-Binary Parity Check Coefficients". 3500
Volume 68, Number 6, June 2022
- Ling-Hua Chang, Po-Ning Chen, Fady Alajaji, Yunghsiang S. Han:
Decoder Ties Do Not Affect the Error Exponent of the Memoryless Binary Symmetric Channel. 3501-3510 - J. Jon Ryu, Shouvik Ganguly, Younghan Kim, Yung-Kyun Noh, Daniel D. Lee:
Nearest Neighbor Density Functional Estimation From Inverse Laplace Transform. 3511-3551 - Oliver Kosut:
A Second-Order Converse Bound for the Multiple-Access Channel via Wringing Dependence. 3552-3584 - Lin Zhou, Yun Wei, Alfred O. Hero III:
Second-Order Asymptotically Optimal Outlier Hypothesis Testing. 3585-3607 - Rumia Sultana, Rémi A. Chou:
Multiple Access Channel Resolvability Codes From Source Resolvability Codes. 3608-3619 - Masahito Hayashi:
Secure List Decoding and its Application to Bit-String Commitment. 3620-3642 - Ziling Heng, Cunsheng Ding:
The Subfield Codes of Some [q + 1, 2, q] MDS Codes. 3643-3656 - Siyi Yang, Ahmed H. Hareedy, A. Robert Calderbank, Lara Dolecek:
Hierarchical Coding for Cloud Storage: Topology-Adaptivity, Scalability, and Flexibility. 3657-3680 - Ohad Elishco, Alexander Barg:
Recoverable Systems. 3681-3699 - Eshed Ram, Yuval Cassuto:
On the Decoding Performance of Spatially Coupled LDPC Codes With Sub-Block Access. 3700-3718 - Niv Beeri, Moshe Schwartz:
Improved Rank-Modulation Codes for DNA Storage With Shotgun Sequencing. 3719-3730 - Christian Deppe, Vladimir S. Lebedev, Georg Maringer, Nikita Polyanskii:
Coding With Noiseless Feedback Over the Z-Channel. 3731-3739 - Kwankyu Lee:
Base Field Extension of AG Codes for Decoding. 3740-3743 - Hengjie Yang, Ethan Liang, Minghao Pan, Richard D. Wesel:
CRC-Aided List Decoding of Convolutional Codes in the Short Blocklength Regime. 3744-3766 - Lorenz Welter, Rawad Bitar, Antonia Wachter-Zeh, Eitan Yaakobi:
Multiple Criss-Cross Insertion and Deletion Correcting Codes. 3767-3779 - Can Xiang, Chunming Tang, Cunsheng Ding:
Shortened Linear Codes From APN and PN Functions. 3780-3795 - Simeon Ball, Ricard Vilar:
Determining When a Truncated Generalised Reed-Solomon Code Is Hermitian Self-Orthogonal. 3796-3805 - Eduardo Camps-Moreno, Elisa Gorla, Cristina Landolina, Elisa Lorenzo García, Umberto Martínez-Peñas, Flavio Salizzoni:
Optimal Anticodes, MSRD Codes, and Generalized Weights in the Sum-Rank Metric. 3806-3822 - Asaf Ferber, Matthew Kwan, Lisa Sauermann:
List-Decodability With Large Radius for Reed-Solomon Codes. 3823-3828 - Zhengzhong Jin, Shiyu Shen, Yunlei Zhao:
Compact and Flexible KEM From Ideal Lattice. 3829-3840 - Fan Zhang, Khac-Hoang Ngo, Sheng Yang, Aria Nosratinia:
Transmit Correlation Diversity: Generalization, New Techniques, and Improved Bounds. 3841-3869 - Guowei Dai, Longkun Guo, Gregory Z. Gutin, Xiaoyan Zhang, Zan-Bo Zhang:
Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths. 3870-3878 - Kai Cai, Guangyue Han:
The Langberg-Médard Multiple Unicast Conjecture for 3-Pair Networks. 3879-3895 - Mohamed A. Abd-Elmagid, Harpreet S. Dhillon:
Closed-Form Characterization of the MGF of AoI in Energy Harvesting Status Update Systems. 3896-3919 - Ru-Han Chen, Longguang Li, Jian Zhang, Wenyi Zhang, Jing Zhou:
On the Capacity of MISO Optical Intensity Channels With Per-Antenna Intensity Constraints. 3920-3941 - Markus Grassl, Felix Huber, Andreas J. Winter:
Entropic Proofs of Singleton Bounds for Quantum Error-Correcting Codes. 3942-3950 - Ching-Yi Lai, Hao-Chung Cheng:
Learning Quantum Circuits of Some T Gates. 3951-3964 - Uzi Pereg, Christian Deppe, Holger Boche:
The Quantum Multiple-Access Channel With Cribbing Encoders. 3965-3988 - Nengkun Yu, Li Zhou:
Comments on and Corrections to "When Is the Chernoff Exponent for Quantum Operations Finite?". 3989-3990 - Yuchen Zhou, Anru R. Zhang, Lili Zheng, Yazhen Wang:
Optimal High-Order Tensor SVD via Tensor-Train Orthogonal Iteration. 3991-4019 - Yuhang Cai, Lek-Heng Lim:
Distances Between Probability Distributions of Different Dimensions. 4020-4031 - Michael Kohler, Adam Krzyzak, Sophie Langer:
Estimation of a Function of Low Local Dimensionality by Deep Neural Networks. 4032-4042 - Yandi Shen, Qiyang Han, Fang Han:
On a Phase Transition in General Order Spline Regression. 4043-4069 - Botond Szabó, Lasse Vuursteen, Harry van Zanten:
Optimal Distributed Composite Testing in High-Dimensional Gaussian Models With 1-Bit Communication. 4070-4084 - Spencer L. Gordon, Leonard J. Schulman:
Hadamard Extensions and the Identification of Mixtures of Product Distributions. 4085-4089 - Fangwei Ye, Hyunghoon Cho, Salim El Rouayheb:
Mechanisms for Hiding Sensitive Genotypes With Information-Theoretic Privacy. 4090-4105 - Chinmay Gurjarpadhye, Jithin Ravi, Sneha Kamath, Bikash Kumar Dey, Nikhil Karamchandani:
Fundamental Limits of Demand-Private Coded Caching. 4106-4134 - Rooji Jinan, Ajay Badita, Pradeep Kiran Sarvepalli, Parimal Parag:
Latency Optimal Storage and Scheduling of Replicated Fragments for Memory Constrained Servers. 4135-4155 - Anindya Bijoy Das, Aditya Ramamoorthy:
Coded Sparse Matrix Computation Schemes That Leverage Partial Stragglers. 4156-4181 - Stephan Dahlke, Sven Heuer, Hajo Holzmann, Pavel Tafo:
Statistically Optimal Estimation of Signals in Modulation Spaces Using Gabor Frames. 4182-4200
Volume 68, Number 7, July 2022
- Qi Cao, Raymond W. Yeung:
Zero-Error Capacity Regions of Noisy Networks. 4201-4223 - Luca Tamanini:
A Generalization of Costa's Entropy Power Inequality. 4224-4229 - Yi Shen, Chenyun Yu, Yuan Shen, Song Li:
An Open Problem on Sparse Representations in Unions of Bases. 4230-4243 - Robert Graczyk, Amos Lapidoth, Neri Merhav, Christoph Pfister:
Guessing Based on Compressed Side Information. 4244-4256 - Cheuk Ting Li:
Infinite Divisibility of Information. 4257-4271 - Mahdi Cheraghchi, Joseph Downs, João Ribeiro, Alexandra Veliche:
Mean-Based Trace Reconstruction Over Oblivious Synchronization Channels. 4272-4281 - Ruxi Shi:
On Variational Principles for Metric Mean Dimension. 4282-4288 - Mira Gonen, Michael Langberg, Alex Sprintson:
Latency and Alphabet Size in the Context of Multicast Network Coding. 4289-4300 - Kai Wan, Hua Sun, Mingyue Ji, Daniela Tuninetti, Giuseppe Caire:
Cache-Aided Matrix Multiplication Retrieval. 4301-4319 - Chaoping Xing, Chen Yuan:
Construction of Optimal (r, δ)-Locally Recoverable Codes and Connection With Graph Theory. 4320-4328 - Lin Sok:
On Linear Codes With One-Dimensional Euclidean Hull and Their Applications to EAQECCs. 4329-4343 - Guangkui Xu, Xiwang Cao, Longjiang Qu:
Infinite Families of 3-Designs and 2-Designs From Almost MDS Codes. 4344-4353 - Minjia Shi, Tor Helleseth, Ferruh Özbudak, Patrick Solé:
Covering Radius of Melas Codes. 4354-4364 - Qianqian Yan, Junling Zhou:
Infinite Families of Linear Codes Supporting More t-Designs. 4365-4377 - Dor Elimelech, Hengjia Wei, Moshe Schwartz:
On the Generalized Covering Radii of Reed-Muller Codes. 4378-4391 - Francisco Maturana, K. V. Rashmi:
Convertible Codes: Enabling Efficient Conversion of Coded Data in Distributed Storage. 4392-4407 - Zhao Hu, Nian Li, Xiangyong Zeng, Lisha Wang, Xiaohu Tang:
A Subfield-Based Construction of Optimal Linear Codes Over Finite Fields. 4408-4421 - Hengjia Wei, Moshe Schwartz:
Sequence Reconstruction for Limited-Magnitude Errors. 4422-4434 - Adrián Torres-Martín, Mercè Villanueva:
Systematic Encoding and Permutation Decoding for Zps-Linear Codes. 4435-4443 - Steven T. Dougherty, Serap Sahinkaya, Deniz Ustun:
Additive Complementary Dual Codes From Group Characters. 4444-4452 - Mohammad Ishtiyaq Qureshi, Satyajit Thakor:
A Bound on Undirected Multiple-Unicast Network Information Flow. 4453-4469 - Junge Wang, Syed Ali Jafar:
Sum-GDoF of Symmetric Multi-Hop Interference Channel Under Finite Precision CSIT Using Aligned-Images Sum-Set Inequalities. 4470-4490 - Sebastian Stern, Cong Ling, Robert F. H. Fischer:
Algorithms and Bounds for Complex and Quaternionic Lattices With Application to MIMO Transmission. 4491-4517 - Kamil Korzekwa, Zbigniew Puchala, Marco Tomamichel, Karol Zyczkowski:
Encoding Classical Information Into Quantum Resources. 4518-4530 - Francisco Revson Fernandes Pereira, Stefano Mancini:
Polar Codes for Quantum Reading. 4531-4548 - Andrew Nemec, Andreas Klappenecker:
A Combinatorial Interpretation for the Shor-Laflamme Weight Enumerators of CWS Codes. 4549-4552 - Jeremiah Birrell, Markos A. Katsoulakis, Yannis Pantazis:
Optimizing Variational Representations of Divergences and Accelerating Their Statistical Estimation. 4553-4572 - Venkata Gandikota, Daniel Kane, Raj Kumar Maity, Arya Mazumdar:
vqSGD: Vector Quantized Stochastic Gradient Descent. 4573-4587 - Elena Castilla, María Jaenada, Leandro Pardo:
Estimation and Testing on Independent Not Identically Distributed Observations Based on Rényi's Pseudodistances. 4588-4609 - Shao-Bo Lin, Kaidong Wang, Yao Wang, Ding-Xuan Zhou:
Universal Consistency of Deep Convolutional Neural Networks. 4610-4617 - Joshua Agterberg, Zachary Lubberts, Carey E. Priebe:
Entrywise Estimation of Singular Vectors of Low-Rank Matrices With Heteroskedasticity and Dependence. 4618-4650 - Nikita Puchkin, Nikita Zhivotovskiy:
Exponential Savings in Agnostic Active Learning Through Abstention. 4651-4665 - Nitish Mital, Cong Ling, Deniz Gündüz:
Secure Distributed Matrix Computation With Discrete Fourier Transform. 4666-4680 - Hua Sun:
Secure Groupcast With Shared Keys. 4681-4699 - Yiqi Chen, Dan He, Chenhao Ying, Yuan Luo:
Strong Secrecy of Arbitrarily Varying Wiretap Channel With Constraints. 4700-4722 - Ran Gelles, Yael Tauman Kalai, Govind Ramnarayan:
Efficient Multiparty Interactive Coding - Part II: Non-Oblivious Noise. 4723-4749 - Faruk Göloglu:
Biprojective Almost Perfect Nonlinear Functions. 4750-4760 - Kangquan Li, Yue Zhou, Chunlei Li, Longjiang Qu:
Two New Families of Quadratic APN Functions. 4761-4769 - Jiaxin Wang, Fang-Wei Fu:
On the Duals of Generalized Bent Functions. 4770-4781 - Chris J. Mitchell, Peter R. Wild:
Constructing Orientable Sequences. 4782-4789 - Gayathri R. Prabhu, Srikrishna Bhashyam, Aditya Gopalan, Rajesh Sundaresan:
Sequential Multi-Hypothesis Testing in Multi-Armed Bandit Problems: An Approach for Asymptotic Optimality. 4790-4817 - Nikolajs Skuratovs, Michael E. Davies:
Compressed Sensing With Upscaled Vector Approximate Message Passing. 4818-4836 - Zhongxing Sun, Wei Cui, Yulong Liu:
Phase Transitions in Recovery of Structured Signals From Corrupted Measurements. 4837-4863 - Santhosh Karnik, Justin Romberg, Mark A. Davenport:
Thomson's Multitaper Method Revisited. 4864-4891 - Mati Wax, Amir Adler:
Detection of the Number of Exponentials by Invariant-Signal-Subspace Matching. 4892-4900
Volume 68, Number 8, August 2022
- Yihan Zhang, Shashank Vatedka, Sidharth Jaggi, Anand D. Sarwate:
Quadratically Constrained Myopic Adversarial Channels. 4901-4948 - Julien Fageot, Alireza Fallah, Thibaut Horel:
Entropic Compressibility of Lévy Processes. 4949-4963 - Lin Zhou, Lin Bai, Alfred Olivier Hero:
Resolution Limits of Non-Adaptive 20 Questions Search for Multiple Targets. 4964-4982 - Stefano Della Fiore, Simone Costa, Marco Dalai:
Improved Bounds for (b, k)-Hashing. 4983-4997 - Jiachun Pan, Yonglong Li, Vincent Y. F. Tan:
Asymptotics of Sequential Composite Hypothesis Testing Under Probabilistic Constraints. 4998-5012 - Abbas El Gamal, Amin Gohari, Chandra Nair:
A Strengthened Cutset Upper Bound on the Capacity of the Relay Channel and Applications. 5013-5043 - Eli Shemuel, Oron Sabag, Haim H. Permuter:
The Feedback Capacity of Noisy Output Is the STate (NOST) Channels. 5044-5059 - Han Cai, Cuiling Fan, Ying Miao, Moshe Schwartz, Xiaohu Tang:
Optimal Locally Repairable Codes: An Improved Bound and Constructions. 5060-5074 - Sven Puchinger, Julian Renner, Johan Rosenkilde:
Generic Decoding in the Sum-Rank Metric. 5075-5097 - Mario Blaum:
Multiple-Layer Integrated Interleaved Codes: A Class of Hierarchical Locally Recoverable Codes. 5098-5111 - Tingting Chen, Xiande Zhang:
Sparse and Balanced MDS Codes Over Small Fields. 5112-5125 - Hao Chen:
Coordinate-Ordering-Free Upper Bounds for Linear Insertion-Deletion Codes. 5126-5132 - Yang Xu, Haibin Kan, Guangyue Han:
A Galois Connection Approach to Wei-Type Duality Theorems. 5133-5144 - Bocong Chen, Guanghui Zhang:
Enumeration of Extended Irreducible Binary Goppa Codes. 5145-5153 - Geyang Wang, Qi Wang:
Q-Ary Non-Overlapping Codes: A Generating Function Approach. 5154-5164 - Roni Con, Itzhak Tamo:
Nonlinear Repair of Reed-Solomon Codes. 5165-5177 - Zitan Chen:
Convolutional Codes With a Maximum Distance Profile Based on Skew Polynomials. 5178-5184 - Songtao Feng, Jing Yang:
Precoding and Scheduling for AoI Minimization in MIMO Broadcast Channels. 5185-5202 - Zijing Wang, Mihai-Alin Badiu, Justin P. Coon:
A Framework for Characterizing the Value of Information in Hidden Markov Models. 5203-5216 - Yuxuan Du, Min-Hsiu Hsieh, Tongliang Liu, Shan You, Dacheng Tao:
Quantum Differentially Private Sparse Regression Learning. 5217-5233 - Yingkai Ouyang, Ching-Yi Lai:
Linear Programming Bounds for Approximate Quantum Error Correction Over Arbitrary Quantum Channels. 5234-5247 - Anmol Kagrecha, Jayakrishnan Nair, Krishna P. Jagannathan:
Statistically Robust, Risk-Averse Best Arm Identification in Multi-Armed Bandits. 5248-5267 - Hua Wang, Yachong Yang, Weijie J. Su:
The Price of Competition: Effect Size Heterogeneity Matters in High Dimensions. 5268-5294 - Zhiqiang Tan, Xinwei Zhang:
On Loss Functions and Regret Bounds for Multi-Category Classification. 5295-5313 - Cong Ma, Banghua Zhu, Jiantao Jiao, Martin J. Wainwright:
Minimax Off-Policy Evaluation for Multi-Armed Bandits. 5314-5339 - Cong Fang, Yihong Gu, Weizhong Zhang, Tong Zhang:
Convex Formulation of Overparameterized Deep Neural Networks. 5340-5352 - Ting-Kam Leonard Wong, Jun Zhang:
Tsallis and Rényi Deformations Linked via a New λ-Duality. 5353-5373 - Chao Gao, Anderson Y. Zhang:
SDP Achieves Exact Minimax Optimality in Phase Synchronization. 5374-5390 - Yihong Wu, Jiaming Xu, Sophie H. Yu:
Settling the Sharp Reconstruction Thresholds of Random Graph Matching. 5391-5417 - Zhuqing Jia, Syed Ali Jafar:
X-Secure T-Private Federated Submodel Learning With Elastic Dropout Resilience. 5418-5439 - Hassan ZivariFard, Matthieu R. Bloch, Aria Nosratinia:
Keyless Covert Communication via Channel State Information. 5440-5474 - Divesh Aggarwal, Maciej Obremski, João Ribeiro, Mark Simkin, Luisa Siniscalchi:
Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors. 5475-5495 - Qifa Yan, Sheng Yang, Michèle A. Wigger:
Storage-Computation-Communication Tradeoff in Distributed Computing: Fundamental Limits and Complexity. 5496-5512 - Subhroshekhar Ghosh, Naoto Miyoshi, Tomoyuki Shirai:
Disordered Complex Networks: Energy Optimal Lattices and Persistent Homology. 5513-5534 - Haode Yan, Yongbo Xia, Chunlei Li, Tor Helleseth, Maosheng Xiong, Jinquan Luo:
The Differential Spectrum of the Power Mapping xpn-3. 5535-5547 - Min Zeng, Yuan Luo, Guo-Sheng Hu, Hong-Yeop Song:
Some Upper Bounds and Exact Values on Linear Complexities Over FM of Sidelnikov Sequences for M = 2 and 3. 5548-5560 - Holger Boche, Volker Pohl:
On Non-Detectability of Non-Computability and the Degree of Non-Computability of Solutions of Circuit and Wave Equations on Digital Computers. 5561-5578 - Takashi Takahashi, Yoshiyuki Kabashima:
Macroscopic Analysis of Vector Approximate Message Passing in a Model-Mismatched Setting. 5579-5600
Volume 68, Number 9, September 2022
- Manuel S. Stein:
Sensitivity Analysis for Binary Sampling Systems via Quantitative Fisher Information Lower Bounds. 5601-5618 - Bruno Mera, Paulo Mateus, Alexandra M. Carvalho:
Model Complexity in Statistical Manifolds: The Role of Curvature. 5619-5636 - Ziv Aharoni, Oron Sabag, Haim H. Permuter:
Feedback Capacity of Ising Channels With Large Alphabet via Reinforcement Learning. 5637-5656 - Nir Weinberger, Neri Merhav:
The DNA Storage Channel: Capacity and Error Probability Bounds. 5657-5700 - Kai Wan, Hua Sun, Mingyue Ji, Daniela Tuninetti, Giuseppe Caire:
On the Fundamental Limits of Device-to-Device Private Caching Under Uncoded Cache Placement and User Collusion. 5701-5729 - Yongchao Wang, Jing Bai:
Decoding Nonbinary LDPC Codes via Proximal-ADMM Approach. 5730-5746 - Ahmed H. Hareedy, Beyza Dabak, A. Robert Calderbank:
The Secret Arithmetic of Patterns: A General Method for Designing Constrained Codes Based on Lexicographic Indexing. 5747-5778 - Mustafa Cemil Coskun, Henry D. Pfister:
An Information-Theoretic Perspective on Successive Cancellation List Decoding and Polar Code Design. 5779-5791 - Chunming Tang, Qi Wang, Cunsheng Ding:
The Subfield Codes and Subfield Subcodes of a Family of MDS Codes. 5792-5801 - Roxana Smarandache, David G. M. Mitchell:
A Unifying Framework to Construct QC-LDPC Tanner Graphs of Desired Girth. 5802-5822 - Michael Rudow, K. V. Rashmi:
Streaming Codes for Variable-Size Messages. 5823-5849 - Kangwook Lee, Nihar B. Shah, Longbo Huang, Kannan Ramchandran:
Addendum and Erratum to "The MDS Queue: Analysing the Latency Performance of Erasure Codes". 5850-5851 - Yizhu Wang, Wenyi Zhang:
Generalized Nearest Neighbor Decoding. 5852-5865 - Neil Irwin Bernardo, Jingge Zhu, Jamie S. Evans:
On the Capacity-Achieving Input of Channels With Phase Quantization. 5866-5888 - Giorgio Taricco:
Information Rate Optimization for the Non-Regenerative Linear MIMO Relay Channel With a Direct Link and Variable Duty Cycle. 5889-5900 - Elie Najm, Emre Telatar, Rajai Nasser:
Optimal Age Over Erasure Channels. 5901-5922 - Andreu Blasco Coll, Gonzalo Vazquez-Vilar, Javier Rodríguez Fonollosa:
Generalized Perfect Codes for Symmetric Classical-Quantum Channels. 5923-5936 - Aditya Nema, Pranab Sen:
Approximate Unitary Designs Give Rise to Quantum Channels With Super Additive Classical Holevo Capacity. 5937-5954 - Christophe Vuillot, Nikolas P. Breuckmann:
Quantum Pin Codes. 5955-5974 - T. Tony Cai, Anru R. Zhang, Yuchen Zhou:
Sparse Group Lasso: Optimal Sample Complexity, Convergence Rate, and Statistical Inference. 5975-6002 - Zirui Sun, Shao-Bo Lin:
Distributed Learning With Dependent Samples. 6003-6020 - Tyler Sypherd, Mario Díaz, John Kevin Cava, Gautam Dasarathy, Peter Kairouz, Lalitha Sankar:
A Tunable Loss Function for Robust Classification: Calibration, Landscape, and Generalization. 6021-6051 - Péter Csikvári, Nicholas Ruozzi, Shahab Shams:
Markov Random Fields, Homomorphism Counting, and Sidorenko's Conjecture. 6052-6062 - Mohsen Heidari, Jithin K. Sreedharan, Gil I. Shamir, Wojciech Szpankowski:
Sufficiently Informative and Relevant Features: An Information-Theoretic and Fourier-Based Characterization. 6063-6077 - Chung-Yi Lin, Victoria Kostina, Babak Hassibi:
Differentially Quantized Gradient Methods. 6078-6097 - Ertan Kazikli, Sinan Gezici, Serdar Yüksel:
Quadratic Privacy-Signaling Games and the MMSE Information Bottleneck Problem for Gaussian Sources. 6098-6113 - Sabyasachi Dey, Chandan Dey, Santanu Sarkar, Willi Meier:
Revisiting Cryptanalysis on ChaCha From Crypto 2020 and Eurocrypt 2021. 6114-6133 - Mindaugas Bloznelis, Jerzy Jaworski, Katarzyna Rybarczyk:
The Cover Time of a Random Walk in Affiliation Networks. 6134-6150 - Gongpu Chen, Soung Chang Liew, Yulin Shao:
Uncertainty-of-Information Scheduling: A Restless Multiarmed Bandit Framework. 6151-6173 - Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl, László Mérai:
On a Class of Functions With the Maximal Number of Bent Components. 6174-6186 - Anne Canteaut, Alain Couvreur, Léo Perrin:
Recovering or Testing Extended-Affine Equivalence. 6187-6206 - Andrzej K. Brodzik, Richard Tolimieri:
M-Ary Character-Based Sequences of Length pq With Low Autocorrelation. 6207-6217 - Avijit Dutta, Mridul Nandi, Abishanka Saha:
Proof of Mirror Theory for ξmax = 2. 6218-6232 - Nicolas Aragon, Olivier Blazy, Jean-Christophe Deneuville, Philippe Gaborit, Gilles Zémor:
Ouroboros: An Efficient and Provably Secure KEM Family. 6233-6244 - Mohammad-Amin Charusaie, Arash Amini, Stefano Rini:
Compressibility Measures for Affinely Singular Random Vectors. 6245-6275 - Alon Kipnis, John C. Duchi:
Mean Estimation From One-Bit Measurements. 6276-6296
Volume 68, Number 10, October 2022
- Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Broadcasting on Two-Dimensional Regular Grids. 6297-6334 - Amir Saberi, Farhad Farokhi, Girish N. Nair:
Zero-Error Feedback Capacity for Bounded Stabilization and Finite-State Additive Noise Channels. 6335-6355 - Pin-Wen Su, Yu-Chih Huang, Shih-Chun Lin, I-Hsiang Wang, Chih-Chun Wang:
Random Linear Streaming Codes in the Finite Memory Length and Decoding Deadline Regime - Part I: Exact Analysis. 6356-6387 - Jing Hao, Han Huang, Galyna V. Livshyts, Konstantin E. Tikhomirov:
Distribution of the Minimum Distance of Random Linear Codes. 6388-6401 - Wentu Song, Nikita Polyanskii, Kui Cai, Xuan He:
Systematic Codes Correcting Multiple-Deletion and Multiple-Substitution Errors. 6402-6416 - Liren Lin, Yun Fan:
Self-Dual 2-Quasi Abelian Codes. 6417-6425 - Stefka Bouyuklieva, Javier de la Cruz:
On the Structure of Binary LCD Codes Having an Automorphism of Odd Prime Order. 6426-6433 - Lev Yohananov, Eitan Yaakobi:
Almost Optimal Construction of Functional Batch Codes Using Extended Simplex Codes. 6434-6451 - Balaji Srinivasan Babu, Myna Vajha, P. Vijay Kumar:
Lower Bounds on the Sub-Packetization Level of MSR Codes and Characterizing Optimal-Access MSR Codes Achieving the Bound. 6452-6471 - Xia Li, Qin Yue:
Construction of Expurgated and Extended Goppa Codes With Dihedral Automorphism Groups. 6472-6480 - Pranava K. Jha:
1-Perfect Codes Over the Quad-Cube. 6481-6504 - Amit Berman, Sarit Buzaglo, Avner Dor, Yaron Shany, Itzhak Tamo:
Repairing Reed-Solomon Codes Evaluated on Subspaces. 6505-6515 - Roni Con, Amir Shpilka, Itzhak Tamo:
Explicit and Efficient Constructions of Linear Codes Against Adversarial Insertions and Deletions. 6516-6526 - Silas L. Fong, Ashish Khisti, Baochun Li, Wai-Tian Tan, Xiaoqing Zhu, John G. Apostolopoulos:
Corrections to "Optimal Streaming Erasure Codes Over the Three-Node Relay Network". 6527 - Xingran Chen, Konstantinos Gatsis, Hamed Hassani, Shirin Saeedi Bidokhti:
Age of Information in Random Access Channels. 6548-6568 - Armanda Ottaviano Quintavalle, Earl T. Campbell:
ReShape: A Decoder for Hypergraph Product Codes. 6569-6584 - Li Gao, Sander Gribling, Yinan Li:
On a Tracial Version of Haemers Bound. 6585-6604 - Jing Wang, Jiahui Zou, HaiYing Wang:
Sampling With Replacement vs Poisson Sampling: A Comparative Study in Optimal Subsampling. 6605-6630 - Xiuyuan Cheng, Alexander Cloninger:
Classification Logit Two-Sample Testing by Neural Networks for Differentiating Near Manifold Densities. 6631-6662 - Xiao-Tong Yuan, Ping Li:
Stability and Risk Bounds of Iterative Hard Thresholding. 6663-6681 - Xiucai Ding, Fan Yang:
Tracy-Widom Distribution for Heterogeneous Gram Matrices With Applications in Signal Detection. 6682-6715 - Pasan Dissanayake, Prathapasinghe Dharmawansa, Yang Chen:
Distribution of the Scaled Condition Number of Single-Spiked Complex Wishart Matrices. 6716-6737 - Parham Boroumand, Albert Guillén i Fàbregas:
Mismatched Binary Hypothesis Testing: Error Exponent Sensitivity. 6738-6761 - Sohom Bhattacharya, Sourav Chatterjee:
Matrix Completion With Data-Dependent Missingness Probabilities. 6762-6773 - Fode Zhang, Jialiang Li, Hon Keung Tony Ng:
Minimum f-Divergence Estimation With Applications to Degradation Data Analysis. 6774-6789 - Elena Grigorescu, Madhu Sudan, Minshen Zhu:
Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Edit Distance. 6790-6801 - Jake B. Perazzone, Eric Graves, Paul L. Yu, Rick S. Blum:
Secret Key-Enabled Authenticated-Capacity Region, Part I: Average Authentication. 6802-6825 - Onur Günlü, Matthieu R. Bloch, Rafael F. Schaefer:
Private Remote Sources for Secure Multi-Function Computation. 6826-6841 - Emre Ozfatura, Deniz Gündüz:
Uncoded Caching and Cross-Level Coded Delivery for Non-Uniform File Popularity. 6842-6859 - Abhishek Sinha, Rajarshi Bhattacharjee:
Optimizing Age-of-Information in Adversarial and Stochastic Environments. 6860-6880 - Yan Liu, Xiaojun Zhang, Shuhui Shen:
New Infinite Family of Sequences Almost Over Q8 With Ideal Autocorrelation. 6881-6887 - Daniel Gabric:
Mutual Borders and Overlaps. 6888-6893 - Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl:
Bent Partitions and Partial Difference Sets. 6894-6903 - Yujie Gu, Sonata Akao, Navid Nasr Esfahani, Ying Miao, Kouichi Sakurai:
On the Information-Theoretic Security of Combinatorial All-or-Nothing Transforms. 6904-6914 - Jan Østergaard, Uri Erez, Ram Zamir:
Incremental Refinements and Multiple Descriptions With Feedback. 6915-6940 - Hao Lou, Farzad Farnoud:
Data Deduplication With Random Substitutions. 6941-6963 - Wenda Zhou, Shirin Jalali, Arian Maleki:
Compressed Sensing in the Presence of Speckle Noise. 6964-6980 - Yong Deng, Min Dong:
Fundamental Structure of Optimal Cache Placement for Coded Caching With Nonuniform Demands. 6528-6547
Volume 68, Number 11, November 2022
- Eric Graves, Jake B. Perazzone, Paul L. Yu, Rick S. Blum:
Secret Key-Enabled Authenticated-Capacity Region, Part - II: Typical-Authentication. 6981-7004 - Nir Weinberger:
Error Probability Bounds for Coded-Index DNA Storage Systems. 7005-7022 - Hengjie Yang, Minghao Pan, Amaael Antonini, Richard D. Wesel:
Sequential Transmission Over Binary Asymmetric Channels With Feedback. 7023-7042 - Yan Hao Ling, Jonathan Scarlett:
Simple Coding Techniques for Many-Hop Relaying. 7043-7053 - Mario Bukal:
The Concavity of Generalized Entropy Powers. 7054-7059 - Chih-Hua Chang, Borja Peleato, Chih-Chun Wang:
Coded Caching With Full Heterogeneity: Exact Capacity of the Two-User/Two-File Case. 7060-7076 - Elad Domanovitz, Ashish Khisti, Wai-Tian Tan, Xiaoqing Zhu, John G. Apostolopoulos:
State-Dependent Symbol-Wise Decode and Forward Codes Over Multihop Relay Networks. 7077-7095 - Cosmin Pohoata, Dmitriy Zakharov:
On the Trifference Problem for Linear Codes. 7096-7099 - Minjia Shi, Rongsheng Wu, Denis S. Krotov:
On q-Ary Shortened-1-Perfect-Like Codes. 7100-7106 - Martin Bossert, Rebekka Schulz, Sebastian Bitzer:
On Hard and Soft Decision Decoding of BCH Codes. 7107-7124 - Joshua Brakensiek, Sivakanth Gopi, Visu Makam:
Lower Bounds for Maximally Recoverable Tensor Codes and Higher Order MDS Codes. 7125-7140 - Johan Chrisnata, Han Mao Kiah, Eitan Yaakobi:
Correcting Deletions With Multiple Reads. 7141-7158 - Jon-Lark Kim, Whan-Hyuk Choi:
Self-Orthogonality Matrix and Reed-Muller Codes. 7159-7164 - Takayuki Nozaki:
Weight Enumerators and Cardinalities for Number-Theoretic Codes. 7165-7173 - Cristina Fernández-Córdoba, Carlos Vela, Mercè Villanueva:
Nonlinearity and Kernel of Z-Linear Simplex and MacDonald Codes . 7174-7183 - Eyar Ben-Tolila, Moshe Schwartz:
On the Reverse-Complement String-Duplication System. 7184-7197 - Sivakanth Gopi, Venkatesan Guruswami:
Improved Maximally Recoverable LRCs Using Skew Polynomials. 7198-7214 - Peter Beelen, Johan Rosenkilde, Grigory Solomatov:
Fast Decoding of AG Codes. 7215-7232 - Jean de Dieu Mutangana, Ravi Tandon:
Topological Interference Management With Confidential Messages. 7233-7253 - Nicolò Michelusi, Gesualdo Scutari, Chang-Shen Lee:
Finite-Bit Quantization for Distributed Algorithms With Linear Convergence. 7254-7280 - Khac-Hoang Ngo, Sheng Yang, Maxime Guillaud, Alexis Decurninge:
Joint Constellation Design for Noncoherent MIMO Multiple-Access Channels. 7281-7305 - Willian H. G. Corrêa, Ludovico Lami, Carlos Palazuelos:
Maximal Gap Between Local and Global Distinguishability of Bipartite Quantum States. 7306-7314 - Hao-Chung Cheng, Eric P. Hanson, Nilanjana Datta, Min-Hsiu Hsieh:
Duality Between Source Coding With Quantum Side Information and Classical-Quantum Channel Coding. 7315-7345 - Omar Fawzi, Ala Shayeghi, Hoang Ta:
A Hierarchy of Efficient Bounds on Quantum Capacities Exploiting Symmetry. 7346-7360 - Saurabh Khanna, Chandra R. Murthy:
On the Support Recovery of Jointly Sparse Gaussian Sources via Sparse Bayesian Learning. 7361-7378 - Elena Castilla, Pedro José Chocano Feito:
A New Robust Approach for Multinomial Logistic Regression With Complex Design Model. 7379-7395 - Mohammad Mehrabi, Aslan Tchamkerten:
Error-Correction for Sparse Support Recovery Algorithms. 7396-7409 - Thanh Van Nguyen, Gauri Jagatap, Chinmay Hegde:
Provable Compressed Sensing With Generative Priors via Langevin Dynamics. 7410-7422 - Ahmed El Alaoui, Andrea Montanari:
An Information-Theoretic View of Stochastic Localization. 7423-7426 - Hye Won Chung, Ji Oon Lee:
Weak Detection in the Spiked Wigner Model. 7427-7453 - Konstantin Makarychev, Miklós Z. Rácz, Cyrus Rashtchian, Sergey Yekhanin:
Batch Optimization for DNA Synthesis. 7454-7470 - Yizhou Zhao, Hua Sun:
Information Theoretic Secure Aggregation With User Dropouts. 7471-7484 - Rémi A. Chou:
Quantifying the Cost of Privately Storing Data in Distributed Storage Systems. 7485-7499 - Weiqi Li, Zhen Chen, Zhiying Wang, Syed Ali Jafar, Hamid Jafarkhani:
Flexible Distributed Matrix Multiplication. 7500-7514 - Jamie Haddock, Benjamin Jarman, Chen Yap:
Paving the Way for Consensus: Convergence of Block Gossip Algorithms. 7515-7527 - Lijing Zheng, Haibin Kan, Yanjun Li, Jie Peng, Deng Tang:
Constructing New APN Functions Through Relative Trace Functions. 7528-7537 - Zhixiong Chen, Zhihua Niu, Arne Winterhof:
Arithmetic Crosscorrelation of Pseudorandom Binary Sequences of Coprime Periods. 7538-7544 - Rishabh Dudeja, Milad Bakhshizadeh:
Universality of Linearized Message Passing for Phase Retrieval With Structured Sensing Matrices. 7545-7574 - Gowtham R. Kurri, Viswanathan Ramachandran, Sibi Raj B. Pillai, Vinod M. Prabhakaran:
Multiple Access Channel Simulation. 7575-7603 - Ming-Hsun Yang, Y.-W. Peter Hong, Jwo-Yuh Wu:
Sparse Affine Sampling: Ambiguity-Free and Efficient Sparse Phase Retrieval. 7604-7626 - Hong Hu, Yue M. Lu:
SLOPE for Sparse Linear Regression: Asymptotics and Optimal Regularization. 7627-7664
Volume 68, Number 12, December 2022
- Venkat Anantharam, Varun S. Jog, Chandra Nair:
Unifying the Brascamp-Lieb Inequality and the Entropy Power Inequality. 7665-7684 - Cheuk Ting Li:
The Undecidability of Conditional Affine Information Inequalities and Conditional Independence Implication With a Binary Constraint. 7685-7701 - Mohammadamin Baniasadi, Erman Koken, Ertem Tuncel:
Minimum Energy Analysis for Robust Gaussian Joint Source-Channel Coding With a Distortion-Noise Profile. 7702-7713 - Asaf Cohen, Neri Merhav:
Universal Randomized Guessing Subject to Distortion. 7714-7734 - Tefjol Pllaha, Olav Tirkkonen, A. Robert Calderbank:
Binary Subspace Chirps. 7735-7752 - Yihan Zhang, Shashank Vatedka:
List Decoding Random Euclidean Codes and Infinite Constellations. 7753-7786 - Alexander Barg, Gilles Zémor:
High-Rate Storage Codes on Triangle-Free Graphs. 7787-7797 - Ron M. Roth:
Higher-Order MDS Codes. 7798-7816 - Ziling Heng, Chengju Li, Xinran Wang:
Constructions of MDS, Near MDS and Almost MDS Codes From Cyclic Subgroups of F*q2. 7817-7831 - Junzhen Sui, Qin Yue, Xia Li, Daitao Huang:
MDS, Near-MDS or 2-MDS Self-Dual Codes via Twisted Generalized Reed-Solomon Codes. 7832-7841 - Chunming Tang, Cunsheng Ding:
Binary [n, (n + 1)/2] Cyclic Codes With Good Minimum Distances. 7842-7849 - Yong Deng, Min Dong:
Memory-Rate Tradeoff for Caching With Uncoded Placement Under Nonuniform Random Demands. 7850-7870 - Federico Brunero, Petros Elia:
Unselfish Coded Caching Can Yield Unbounded Gains Over Selfish Caching. 7871-7891 - Michal Studzinski, Marek Mozrzymas, Piotr Kopszak, Michal Horodecki:
Efficient Multi Port-Based Teleportation Schemes. 7892-7912 - Mohammad Aamir Sohail, Touheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan:
Computing Sum of Sources Over a Classical-Quantum MAC. 7913-7934 - Aolin Xu, Maxim Raginsky:
Minimum Excess Risk in Bayesian Learning. 7935-7955 - Inbar Seroussi, Ofer Zeitouni:
Lower Bounds on the Generalization Error of Nonlinear Learning Models. 7956-7970 - Puning Zhao, Lifeng Lai:
Analysis of KNN Density Estimation. 7971-7995 - Deepak Kumar Rakesh, Prasanta K. Jana:
A General Framework for Class Label Specific Mutual Information Feature Selection Method. 7996-8014 - Lei Liu, Shunqi Huang, Brian M. Kurkoski:
Memory AMP. 8015-8039 - Yuchen Liang, Venugopal V. Veeravalli:
Non-Parametric Quickest Mean-Change Detection. 8040-8052 - Arnab Auddy, Ming Yuan:
On Estimating Rank-One Spiked Tensors in the Presence of Heavy Tailed Errors. 8053-8075 - Avishek Ghosh, Jichan Chung, Dong Yin, Kannan Ramchandran:
An Efficient Framework for Clustered Federated Learning. 8076-8091 - Prathapasinghe Dharmawansa, Pasan Dissanayake, Yang Chen:
The Eigenvectors of Single-Spiked Complex Wishart Matrices: Finite and Asymptotic Analyses. 8092-8120 - Keigo Takeuchi:
On the Convergence of Orthogonal/Vector AMP: Long-Memory Message-Passing Strategy. 8121-8138 - Iryna Gurevych, Michael Kohler, Gözde Gül Sahin:
On the Rate of Convergence of a Classifier Based on a Transformer Encoder. 8139-8155 - Paria Rashidinejad, Banghua Zhu, Cong Ma, Jiantao Jiao, Stuart Russell:
Bridging Offline Reinforcement Learning and Imitation Learning: A Tale of Pessimism. 8156-8196 - Gianluca Brian, Antonio Faonio, Maciej Obremski, João Ribeiro, Mark Simkin, Maciej Skórski, Daniele Venturi:
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free. 8197-8227 - Ivan Tjuawinata, Chaoping Xing:
Leakage-Resilient Secret Sharing With Constant Share Size. 8228-8250 - Daniel J. Katz, Eli Moore:
Sequence Pairs With Lowest Combined Autocorrelation and Crosscorrelation. 8251-8267 - Tapas Chatterjee, Ayantika Laha, Somitra Kumar Sanadhya:
On the Structure of Format Preserving Sets in the Diffusion Layer of Block Ciphers. 8268-8279 - Jinchi Chen, Weiguo Gao, Sihan Mao, Ke Wei:
Vectorized Hankel Lift: A Convex Approach for Blind Super-Resolution of Point Sources. 8280-8309 - Michael Murray, Jared Tanner:
Encoder Blind Combinatorial Compressed Sensing. 8310-8341 - Neri Merhav:
Optimal Correlators and Waveforms for Mismatched Detection. 8342-8354
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.