# List of Accepted Papers

 1059 A Blahut-Arimoto Type Algorithm for Computing Classical-Quantum Channel Capacity 1368 A Capacity-Achieving T-PIR Scheme Based On MDS Array Codes 2042 A Computation-Communication Tradeoff Study for Mobile Edge Computing Networks 1738 A Concentration of Measure Approach to Database De-anonymization 1863 A Construction of Traceability Set Systems with Polynomial Tracing Algorithm 1613 A Correlation Measure Based on Vector-Valued L_p Norms 1270 A Deterministic Algorithm for the Capacity of Finite-State Channels 1454 A Direct and Generalized Construction of Polyphase Complementary Set With Low PMEPR 1885 A Family of Bayesian Cramer-Rao Bounds, and Consequences for Log-Concave Priors 1173 A Fast Node Arrangement Algorithm of Wireless Sensor Networks for Two-dimensional Constraints 1752 A Fundamental Storage-Communication Tradeoff in Distributed Computing with Straggling Nodes 1319 A General Upper Bound on Point-to-Point Particle Timing Channel Capacity Under Constant Particle Emission Intensity 1988 A Generalisation of Interlinked Cycle Structures and Their Index Coding Capacity 1626 A Generalization of the Blackburn-Etzion Construction for Private Information Retrieval Array Codes 1344 A Graph-Based Modular Coding Scheme Which Achieves Semantic Security 2047 A Group Testing Approach to Random Access for Short-Packet Communication 1415 A local perspective on the edge removal problem 2056 A Lower Bound on Minimum Distance of Convolutional Polar Codes 1664 A Lower Bound on the Error Exponent of Linear Block Codes over the Erasure Channel 1854 A Measure of Synergy, Redundancy, and Unique Information using Information Geometry 2114 A method to find the volume of a sphere in the Lee metric, and its applications 2076 A Method to Improve Consensus Averaging using Quantized ADMM 2004 A Modified Min-Sum Algorithm for Quantized LDPC Decoders 1903 A New Algorithm for Two-Stage Group Testing 1835 A New Design of Private Information Retrieval for Storage Constrained Databases 1359 A New Look at an Old Problem: A Universal Learning Approach to Linear Regression 1628 A New Permutation Decoding Method for Reed-Muller Codes 2080 A New Proof for the Quadratic Gaussian Two-Encoder Source-Coding Problem 1890 A New Proof of Nonsignalling Multiprover Parallel Repetition Theorem 1370 A Novel Cache-aided Fog-RAN Architecture 1766 A Proof of de Bruijn Identity based on Generalized Price's Theorem 1742 A Quadratic Field-Size Rate-Optimal Streaming Code for Channels with Burst and Random Erasures 1699 A Random Walk Approach to First-Order Stochastic Convex Optimization 1299 A Recursive Cost-Constrained Construction that Attains the Expurgated Exponent 1842 A Simple Derivation of the Refined SPB for the Constant Composition Codes 1263 A Tight Converse to the Asymptotic Performance of Byzantine Distributed Sequential Change Detection 1570 A Tunable Loss Function for Binary Classification 2030 A Unified Adaptive Recoding Framework for Batched Network Coding 1166 A Unified Framework for One-shot Achievability via the Poisson Matching Lemma 1397 A Unified Framework of State Evolution for Message-Passing Algorithms 1992 A Variational Signal-Space Distance Measure for Nondispersive Optical Fiber 1871 Achievable Rate Region for Iterative Multi-User Detection via Low-cost Gaussian Approximation 2022 Achievable Rates and Outer Bounds for Full-Duplex Relay Broadcast Channel with Side Message 1656 Achieving Vanishing Rate Loss in Decentralized Network MIMO 1744 Active Hypothesis Testing: Beyond Chernoff-Stein 1797 Adaptive Sequence Phase Detection 1641 Adversarial Influence Maximization 1525 Age of Information With Prioritized Streams: When to Buffer Preempted Packets? 1202 Age-Delay Tradeoffs in Single Server Systems 1759 Algebraic Properties of Wyner Common Information Solution under Graphical Constraints 1524 Algorithms for Q-ary Error-Correcting Codes with Partial Feedback and Limited Magnitude 2051 Almost Exact Analysis of Soft Covering Lemma via Large Deviation 1614 An Almost Perfectly Predictable Process with No Optimal Predictor 1687 An Analysis of State Evolution for Approximate Message Passing with Side Information 1011 An Efficient Algorithm for Capacity-Approaching Noisy Adaptive Group Testing 1234 An Elementary Proof of a Classical Information-Theoretic Formula 1620 An Inequality Useful for Proofs of Strong Converse Theorems in Network Information Theory 1295 An Information Theoretic Approach to Probability Mass Function Truncation 1151 An Information Theoretic Interpretation to Deep Neural Networks 1331 An Information Theoretic Model for Side-Channel Cryptanalysis 1675 An information theoretic model for summarization, and some basic results 1951 An Information-Theoretic Explanation for the Adversarial Fragility of AI Classifiers 1944 An Information-Theoretic View of Generalization via Wasserstein Distance? 1732 An Iterative Algorithm to Optimize the Average Performance of Ergodic Markov Chains with Finite States 1201 An Optimal Linear Error Correcting Delivery Scheme for Coded Caching with Shared Caches 1335 An Outer Bound on the Expected Distortion of Joint Source-Channel Coding 1240 An Upper Bound on the Number of Mass Points in the Capacity Achieving Distribution for the Amplitude Constrained Additive Gaussian Channel 1901 An Upper Bound to the Mismatch Capacity 1114 Analog error-correcting codes 1426 Analysis of Data Harvesting by Unmanned Aerial Vehicles 1838 Anchor-Based Correction of Substitutions in Indexed Sets 1336 Application of Complementary Dual AG Codes to Entanglement-Assisted Quantum Codes 1529 Approximation algorithms for classical-quantum channel coding 1252 Asymptotic Analysis on LDPC-BICM Scheme for Compute-and-Forward Relaying 1410 Asymptotic Properties of Recursive Particle Maximum Likelihood Estimation 2143 Asymptotics and Optimal Designs of SLOPE for Sparse Linear Regression 1032 Asymptotics of Entropy of the Dirichlet-Multinomial Distribution 1946 Asymptotics of MAP Inference in Deep Networks 1806 Asymptotics of the random coding error probability for constant-composition codes 1818 Asynchronous Multi-Sensor Change-Point Detection for Seismic Tremors 1713 Attributes of Generator Matrices for Best Finite Blocklength Wiretap Codes 1794 AVN-based elimination of short cycles in Tanner graphs of QC LDPC codes 2038 Backtracking and Look-Ahead Decoding Algorithms for Improved Successive Cancellation Decoding Performance of Polar Codes 1388 Bayesian Quickest Detection of Changes in Statistically Periodic Processes 2007 Being correct eventually almost surely 1412 Binary Recursive Estimation on Noisy Hardware 1467 Biometric Systems with Multiuser Access Structures 1334 Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs from LSBs 1607 Boolean Functions with Biased Inputs: Approximation and Noise Sensitivity 1403 Bounded Single Insertion/Deletion Correcting Codes 1666 Bounds on Codes for the Bit-Shift Channel with (d,k)-Constrained Inputs 1149 Bounds on the Length of Functional PIR and Batch Codes 1422 Breaking HK17 Completely 1038 Broadcasting correlated Gaussians and asymmetric data transmission 1245 Broadcasting Information subject to State Masking over a MIMO State Dependent Gaussian Channel 1324 Broadcasting on Random Networks 1948 Byzantine-Tolerant Distributed Coordinate Descent 1288 Cache-Aided Two-User Broadcast Channels with State Information at Receivers 1919 CAMR: Coded Aggregated MapReduce 1264 Capacity analysis of MISO channels with one-bit transceiver 1815 Capacity of dynamical storage systems 1291 Capacity of Quantum Private Information Retrieval with Multiple Servers 2053 Capacity of Single-Server Single-Message Private Information Retrieval with Private Coded Side Information 1313 Capacity per Unit-Energy of Gaussian Many-Access Channels 1694 Capacity Results for the Noisy Shuffling Channel 1959 Capacity Results via Message Merging and Superposition Coding in the $K$-Receiver Broadcast Channel with General Message Sets 1981 Capacity Scaling for Fronthaul-limited Cloud Radio Access Networks 1673 Capacity-Achieving Coding Scheme for the MAC with Degraded Message Sets and Feedback 1379 Capacity-Achieving Private Information Retrieval Codes from MDS-Coded Databases with Minimum Message Size 1994 Cascaded Coded Distributed Computing on Heterogeneous Networks 1756 Channel Conditions for the Optimality of Interference Decoding Schemes for K-user Gaussian Interference Channels 2127 Channel Decoding with Quantum Approximate Optimization Algorithm 1717 Classification in a Large Network 1826 Classification of Optimal Ternary (r,\delta)-Locally Repairable Codes Attaining the Singleton-like Bound 1605 Closing the Gap for Coded Caching with Distinct File Sizes 1817 Cloud-Aided Interference Management with Cache-Enabled Edge Nodes and Users 2101 Cloud-Assisted On-Sensor Observation Classification in Latency-Impeded IoT Systems 1571 Clustering-Correcting Codes 1598 Code Construction for Pliable Index Coding 1814 Code Design Principles for Ultra-Reliable Random Access with Preassigned Patterns 1963 Coded Caching based on Combinatorial Designs 2059 Coded Caching via Projective Geometry: A new low subpacketization scheme 1351 Coded Caching with Full Heterogeneity: Exact Capacity of The Two-User/Two-File Case 1672 Coded Caching with Heterogeneous File Demand Sets --- The Insufficiency of Selfish Coded Caching 1588 Coded Caching with Heterogeneous User Profiles 2130 Coded Caching with Small Subpacketization via Spatial Reuse and Content Base Replication 1340 Coded Distributed Computing over Packet Erasure Channels 1172 Coded elastic computing 1401 Coded Federated Computing in Wireless Networks with Straggling Devices and Imperfect CSI 1758 Coded MapReduce Schemes Based on Placement Delivery Array 1429 Coded Matrix Multiplication on a Group-Based Model 1996 CodedSketch: Coded Distributed Computation of Approximated Matrix Multiplication 1877 Codes for Covert Communication over Additive White Gaussian Noise Channels 1488 Codes for Updating Linear Functions over Small Fields 1618 Coding for Deletion Channels with Multiple Traces 1327 Coding for Write $\ell$-step-up Memories 1562 Community Detection with Side Information via Semidefinite Programming 1500 Complexity and Similarity for Sequences using LZ77-based conditional information measure 1034 Composable, Unconditionally Secure Message Authentication without any Secret Key 1576 Compress-and-Forward via Multilevel Coding 1052 Compression of Preferential Attachment Graphs 2026 Compressive Sensing with a Multiple Convex Sets Domain 1645 Computable Upper Bounds for Unifilar Finite-State Channels 1430 Computing the Feedback Capacity of Finite State Channels using Reinforcement Learning 1770 Concentration and Tail Bounds for Missing Mass 1476 Constrained Communication Over the Gaussian Dirty Paper Channel 1469 Constrained de Bruijn Codes and their Applications 1599 Construction of Partial Geometries and LDPC codes based on Reed-Solomon Codes 1894 Constructions of batch codes via finite geometry 1256 Constructions of Two-Dimensional Binary Z-Complementary Array Pairs 1790 Constructive spherical codes in 2ᵏ dimensions 1572 Context Block Estimation for Random Fields 1084 Continuous-Source Fuzzy Extractors: Source uncertainty and insecurity 1980 Convergence of Chao Unseen Species Estimator 1769 Convergent Dynamics for Solving the TAP Equations of Ising Models with Arbitrary Rotation Invariant Coupling Matrices 1879 Convexity and Operational Interpretation of the Quantum Information Bottleneck Function 1840 Convolutional Decoding of Polar Codes 1369 Convolutional LPDC codes for Distributed Storage Systems 1688 Correcting Deletions in Multiple-Heads Racetrack Memories 1543 Cost-Aware Learning for Improved Identifiability with Multiple Experiments 1498 Countably Infinite Multilevel Source Polarization for Non-Stationary Erasure Distributions 1643 Counting Graphs with a Given Degree Sequence: An Information-theoretic Perspective 1956 Counting Homomorphisms in Bipartite Graphs 1277 Covert Communication Over a Compound Discrete Memoryless Channel 1496 Cryptanalysis of a One-Time Code-Based Digital Signature Scheme 1949 Data Encoding Methods for Byzantine-Resilient Distributed Optimization 2128 Decentralized Massive MIMO Systems: Is There Anything to be Discussed? 1278 Decentralized Pliable Index Coding 2085 Decision Procedure for the Existence of Two-Channel Prefix-Free Codes 1726 Decoding Gabidulin Codes via Partial Inverses of Linearized Polynomials 1286 Decoding of Generalized Three-Layer Integrated Interleaved Codes 1857 Deep learning and MARS: dimensionality reduction and rates of convergence 1205 Deep Learning-Aided Trainable Projected Gradient Decoding for LDPC Codes 1999 Degrees of Freedom Region of the (M, N_1, N_2) MIMO Broadcast Channel with Partial CSIT: An Application of Sum-set Inequalities 1448 Design of Polar Codes for Parallel Channels with an Average Power Constraint 1073 Detecting Changes in Hidden Markov Models 1622 Directed Intersection Representations and the Information Content of Digraphs 1306 Distributed and Private Coded Matrix Computation with Flexible Communication Load 1129 Distributed Compression of Correlated Classical-Quantum Sources 1943 Distributed False Discovery Rate Control with Quantization 1908 Distributed Matrix Multiplication with Array MDS BP-XOR Codes for Scaling Clusters 1964 Distributed Matrix-Vector Multiplication: A Convolutional Coding Approach 1395 Distributed Stochastic Gradient Descent Using LDGM Codes 1177 Divergence Family Attains Blockchain Applications via alpha-EM Algorithm 1928 DNN assisted Sphere Decoder 1044 Double and Triple Node-Erasure-Correcting Codes over Graphs 1793 Double Nearest-Neighbor Error Correcting Codes on Hexagonal Signal Constellation 1239 Download and Access Trade-offs in Lagrange Coded Computing 1977 Dual Loomis-Whitney inequalities via information theory 2112 Duality between source coding with quantum side information and c-q channel coding 1839 Dynamic Pricing for Controlling Age of Information 1148 Dynamic Programming for Quantization of q-ary Input Discrete Memoryless Channels 1117 Efficient and Explicit Balanced Primer Codes 1083 Efficient MDS Array Codes for Correcting Multiple Column Erasures 1869 Embedding Covert Information on a Given Broadcast Code 1671 Energy efficient random access for the quasi-static fading MAC 1540 Entanglement-Assisted Quantum Data Compression 1170 Entropic Central Limit Theorem for Rényi Entropy 2032 Entropy Bound for the Classical Capacity of a Quantum Channel Assisted by Classical Feedback 1405 Entropy Bounds for Grammar-Based Tree Compressors 1585 Enumeration and Coding of Compact Code Trees for Binary AIFV Codes 1381 Equality in the Matrix Entropy-Power Inequality and Blind Separation of Real and Complex sources 1353 Ergodic MIMO Mutual Information: Twenty Years After Emre Telatar 1273 Ergodic Spatial Nulling for Achieving Interference Free Rates 1775 Error Exponents in Distributed Hypothesis Testing of Correlations 1589 Error Exponents of Parallel Two-way Discrete Memoryless Channels using Variable Length Coding 1030 Error Exponents of Typical Random Codes for the Colored Gaussian Channel 1728 Estimating the Maximum a Posteriori Threshold for Serially Concatenated Turbo Codes 2075 Evolution Analysis of Iterative BICM Receivers with Expectation Propagation over ISI Channels 1027 Exact Channel Synthesis 2028 Exact Recovery for a Family of Community-Detection Generative Models 1472 Explicit constructions of MSR codes for the rack-aware storage model 1203 Explicit Polar Codes with Small Scaling Exponent 1237 Exponent Trade-off for Hypothesis Testing Over Noisy Channels 1144 Exponential Strong Converse for Successive Refinement with Causal Decoder Side Information 1974 Faithful Simulation of Distributed Quantum Measurements with Applications in Distributed Rate-Distortion Theory 1025 False-Accept/False-Reject Trade-offs for Ensembles of Biometric Authentication Systems 1875 Fast Construction of Almost Optimal Symbol Distributions for Asymmetric Numeral Systems 1595 Finding Better Web Communities in Digraphs via Max-Flow Min-Cut 1957 Fisher Information for Distributed Estimation under a Blackboard Communication Protocol 1665 Fitting ReLUs via SGD and Quantized SGD 1315 From Classical to Semi-Quantum Secure Communication 1900 From Parameter Estimation to Dispersion of Nonstationary Gauss-Markov Processes 1464 Functional Covering of Point Processes 1895 Fundamental Limits of Coded Caching: The Memory Rate Pair (K-1-1/K,1/(K-1)) 1522 Gambling and Rényi Divergence 1934 GASP Codes for Secure Distributed Matrix Multiplication 1695 Gaussian Approximation of Quantization Error for Estimation from Compressed Data 2079 Gaussian Graphical Model Selection from Size Constrained Measurements 1777 Generalized Alignment Chain: Improved Converse Results for Index Coding 1100 Generalized Sphere-Packing Bound for Subblock-Constrained Codes 1230 Girth Properties of Time-Varying SC-LDPC Convolutional Codes 1914 Global Optimality of Encoders and MSE Decoders for Communicating Unstable Markov Processes over Unstable Gaussian Recursive Models with Feedback: A Nonanticipative RDF Approach 1778 Good Stabilizer Codes from Quasi-Cyclic Codes over $\F_4$ and $\F_9$ 2070 Gradient Coding Based on Block Designs for Mitigating Adversarial Stragglers 1212 Graph Learning with Partial Observations: Role of Degree Concentration 2096 Greedy additive approximation algorithms for minimum-entropy coupling problem. 1989 Guessing random additive noise decoding with soft detection symbol reliability information - SGRAND 1249 Hamming Distance Distribution of the 0-reprocessing Estimate of the Ordered Statistic Decoder 2046 Harmless interpolation of noisy data in regression 2074 Harmonic Coding: An Optimal Linear Code for Privacy-Preserving Gradient-Type Computation 1677 High-Dimensional Linear Regression and Phase Retrieval via PSLQ Integer Relation Algorithm 1118 How Should we Define Information Flow in Neuroscience? 2054 How to Break the Limits of Secrecy Constraints in Communication Networks 1779 How to Modify Polar Codes for List Decoding 1847 How to Use Undiscovered Information Inequalities: Direct Applications of the Copy Lemma 1828 Hypothesis Testing over a Noisy Channel 1864 Identification Capacity of Correlation-Assisted Discrete Memoryless Channels: Analytical Properties and Representations 2146 Identification, Secrecy, Template, and Privacy-Leakage of Biometric Identification System under Noisy Enrollment 1127 Improved bounds and Optimal Constructions of Locally Repairable Codes with distance 5 and 6 1337 Improved bounds on Gaussian MAC and sparse regression via Gaussian inequalities 1518 Improved Hybrid Design of Polar Codes and Multi-Kernel Polar Codes 1784 Improved Iterative Decoding of Product Codes Based on Trusted Symbols 1080 Improved iterative decoding of QC-MDPC codes in the McEliece public key cryptosystem 2126 Improved MDL Estimators Using Local Exponential Family Bundles Applied to Mixture Families 1322 Improved Soft Decoding of Reed-Solomon Codes on Gilbert-Elliott Channels 2027 Improved Upper Bounds on the Hermit and KZ Constants 2016 Improved Veron Identification and Signature Schemes in the Rank Metric 1868 In-Band Sensing of the Adversary's Channel for Secure Communication in Wireless Channels 1196 Information and Energy Transmission with Experimentally-Sampled Harvesting Functions 1404 Information Storage in the Stochastic Ising Model at Low Temperature 1993 Information-Theoretic Privacy Watchdogs 1332 Interactions Between Learning and Broadcasting in Wireless Recommendation Systems 1844 Interactive Channel Capacity is at least 1/20 the Shannon Capacity 1386 Interactive Leakage Chain Rule for Quantum Min-entropy 1750 Interference Channels with Confidential Messages: Leveraging OFDM Transmission to Scale up Secure Degrees of Freedom with No CSIT 1904 INTERPOL: Information Theoretically Verifiable Polynomial Evaluation 1062 Interpolation-based Decoding of Nonlinear Maximum Rank Distance codes 1884 Invariants and Inequivalence of Linear Rank-Metric Codes 2148 Irregular Product Coded Computation for High-Dimensional Matrix Multiplication 1560 Iterative Collaborative Filtering for Sparse Noisy Tensor Completion 1199 Iterative Decoding of Reed-Solomon Codes based on Non-binary Matrices 1830 JOBS: Joint-Sparse Optimization from Bootstrap Samples 1384 Joint Sampling and Recovery of Correlated Sources 1924 Joint Source-Channel Coding for Gaussian Sources over AWGN Channels using Variational Autoencoders 1503 Joint Source-Channel Coding for the Multiple-Access Channel with Correlated Sources 1115 Joint Source-Channel Coding for the Transmission of Correlated Sources over Two-Way Channels 1542 Joint State Sensing and Communication over Memoryless Multiple Access Channels 1428 Kerdock Codes Determine Unitary 2-Designs 1774 Large Deviations of Typical Random Codes 1187 Latency Limits for Content Delivery in a Fog-RAN with D2D Communication 1763 LDPC Coded Multiuser Shaping for the Gaussian Multiple Access Channel 1962 LDPC Codes for Portable DNA Storage 1820 Learned Belief-Propagation Decoding with Simple Scaling and SNR Adaptation 1762 Learning Feature Nonlinearities with Regularized Binned Regression 1804 Learning to Detect an Odd Markov Arm 1627 Linear Permutation Polynomial Codes 1616 Linear Programming Bounds for Cardinality and Energy of Codes of Given Min and Max Distances 1932 Linearly Convergent Algorithms for Learning Shallow Residual Networks 1153 Linear-Time Encoders for Codes Correcting a Single Edit for DNA-Based Data Storage 1812 List Decoding of Deletions Using Guess & Check Codes 1301 List Decoding Random Euclidean Codes and Infinite Constellations 1105 Local Decoding and Update of Compressed Data 1816 Local Geometry of Cross Entropy Loss in Learning One-Hidden-Layer Neural Networks 1116 Local-Encoding-Preserving Secure Network Coding for Fixed Dimension 2099 Locality in Index Coding for Large Min-Rank 1281 Locally Repairable Convolutional Codes with Sliding Window Repair 1292 Loong: a new IND-CCA-secure code-based KEM 1841 Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access Scenarios 1997 Low-degree Pseudo-Boolean Function Recovery Using Codes 1630 Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes using Linear Programming 1855 Machine Learning at the Wireless Edge: Distributed Stochastic Gradient Descent Over-the-Air 2052 Manufacturing an Erasure Wiretap Channel from Channel Sounding Measurements 1406 Mapping Heterogeneity Does Not Affect Wireless Coded MapReduce 2060 Massive Random Access with Common Alarm Messages 1795 Maximum Likelihood Tensor Decomposition of Markov Decision Process 1849 Mean estimation for entangled single-sample distributions 1459 Measuring Quantum Entropy 1211 Message and State Communication over Channels with Action Dependent States 1455 Message Transmission over Classical Quantum Channels with a Jammer with Side Information, Correlation as Resource and Common Randomness Generating 1452 Metrics which turn tilings into binary perfect codes 1318 Minimax Regression via Adaptive Nearest Neighbor 2119 Minimizing Age in Gateway Based Update Systems 1349 Modeling Packet Losses in Communication Networks 2117 Moderate deviation analysis of majorisation-based resource interconversion 1631 Monotonicity of Entropy in Positively Correlated Ising Trees 2061 Multi-Antenna Jamming in Covert Communication 1723 Multicasting Energy and Information Simultaneously 1982 Multiple Access Channels with Adversarial Users 1755 Multi-User UD k-Ary Codes Recursively Constructed from Short-Length Multiary Codes for Multiple-Access Adder Channel 2073 Mutual Information as a Function of Moments 1209 Mutual Information Estimation: Independence Detection and Consistency 1517 Mutual Information for the Stochastic Block Model by the Adaptive Interpolation Method 2008 Nearly Sharp Restricted Isometry Condition of Rank Aware Order Recursive Matching Pursuit 1320 Near-optimal Repair of Reed-Solomon Codes with Low Sub-packetization 1512 Near-Optimal Zero Correlation Zone Sequence Sets from Paraunitary Matrices 1088 Network Coding Solutions for the Combination Network and its Subgraphs 1648 New Converses for the Relay Channel via Reverse Hypercontractivity 1122 New Regenerating Codes over Binary Cyclic Codes 1594 New Sum-Rate Capacity Results for Multi-User Interference Channels 1186 New Uniform Bounds for Almost Lossless Analog Compression 1602 No Feedback, No Problem: Capacity of Erasure Broadcast Channels with Single-User Delayed CSI 2064 Non-asymptotic Coded Slotted ALOHA 1169 Non-Asymptotic Fundamental Limits of Guessing Subject to Distortion 1721 Non-Malleable Codes against Active Physical Layer Adversary 1140 Non-Negative Matrix Factorization via Low-Rank Stochastic Manifold Optimization 2072 Numerically Stable Polynomially Coded Computing 1929 On (2n/3-1)-Resilient (n,2)-Functions 1760 On Byzantine Distributed Sequential Change Detection with Multiple Hypotheses 1822 On Coded Caching with Correlated Files 1057 On Coding Over Sliced Information 2069 On Construction of Polar Subcodes with Large Kernels 1505 On D2D Caching with Uncoded Cache Placement 1639 On Decentralized Power Control for Ergodic MIMO Multiple Access Channels 1546 On Decoding and Applications of Interleaved Goppa Codes 1232 On Decoding Random-Access SC-LDPC Codes 1329 On Deletion/Insertion of Zeros and Asymmetric Error Control Codes 1284 On Dual Codes in the Doob Schemes 1856 On Epsilon-MSCR Codes for Two Erasures 1734 On Error Exponents Under A Privacy-Preserving Voting Regime 1552 On Estimation under Noisy Order Statistics 1022 On Exact and ∞-Renyi Common Informations 1916 On Fractional Decoding of Reed-Solomon Codes 1772 On Index coding for Complementary Graphs with focus on Circular Perfect Graphs 1612 On Isotopic Shift Construction for Planar Functions 1507 On Multi-Cell Uplink-Downlink Duality with Treating Inter-Cell Interference as Noise 1603 On Multiterminal Communication over MIMO Channels with One-bit ADCs at the Receivers 1132 On Optimal Locally Repairable Codes with Super-Linear Length 1650 On Polar Coding for Binary Dirty Paper 1881 On Simple Scheduling in Half-Duplex Relay Diamond Networks 1089 On Stochastic Orders and Fading Gaussian Multi-User Channels with Statistical CSIT 1181 On the Access Complexity of PIR Schemes 1266 On the Algorithmic Solvability of the Spectral Factorization and the Calculation of the Wiener Filter on Turing Machines 2082 On the Analysis of Energy-Distortion Tradeoff for Zero-Delay Transmission over Gaussian Broadcast Channels 1162 On the Bias of Directed Information Estimators 1098 On the Capacity of Gaussian Multiple-Access Interference Channels 1733 On the Capacity of Leaky Private Information Retrieval 1330 On the Capacity of Sampled Interference-Limited Communications Channels 1724 On the Capacity of the Flash Memory Channel with Inter-cell Interference 1782 On the Capacity Scalability of Line Networks with Buffer Size Constraints 2152 On the Complexity of Computing the Shannon Outer Bound to a Network Coding Capacity Region 1990 On the Complexity of the 3XORSUM Problem 1549 On the Computational Complexity of Blind Detection of Binary Linear Codes 1018 On the Conditional Smooth Renyi Entropy and Its Application in Guessing 1533 On the Connectivity of Inhomogeneous Random K-out Graphs 1156 On the Convergence of the Polarization Process in the Noisiness/Weak-* Topology 1905 On the CVP for the root lattices via folding with deep ReLU neural networks 1813 On the Degrees of Freedom of the Oversampled Wiener Phase Noise Channel 1214 On the Distance Between the Rumor Source and Its Optimal Estimate in a Regular Tree 1051 On the Error Probability of Optimal Codes in Gaussian Channels under Maximal Power Constraint 1479 On the Fundamental Limits of Multi-user Scheduling under Short-term Fairness Constraints 1709 On the I/O Costs in Repairing Short-Length Reed-Solomon Codes 1372 On the Importance of Asymmetry and Monotonicity Constraints in Maximal Correlation Analysis 1911 On the Maximum Number of Codewords of X-Codes of Constant Weight Three 1661 On the Minimum Delay of Block Interleaver for Batched Network Codes 1035 On the Most Informative Boolean Functions of the Very Noisy Channel 1651 On the Multicast Capacity of Full-Duplex 1-2-1 Networks 1538 On the Mutual Information of Two Boolean Functions, with Application to Privacy 1768 On the Non-Adaptive Zero-Error Capacity of the Discrete Memoryless Two-Way Channel 1635 On the Number of Bins in Equilibria for Signaling Games 1568 On the Optimal Delay Amplification Factor of Multi-Hop Relay Channels 1773 On the Optimal Input of the Nondispersive Optical Fiber 1257 On the Optimal Reconstruction Degree of Fractional Repetition Codes 1155 On the Polarization Levels of Automorphic-Symmetric Channels 1347 On the Polarization of R\'{e}nyi Entropy 1735 On the Price of Source Anonymity in Heterogeneous Parametric Point Estimation 1983 On the question of the best additive noise among symmetric log-concave noises 1366 On the Robustness of Noisy ACE Algorithm and Multi-Layer Residual Learning 1126 On the size of pairwise-colliding permutations 1927 On two-fold packings of radius-1 balls in Hamming graphs 1287 One-Bit ExpanderSketch for One-Bit Compressed Sensing 1492 One-Shot Perfect Secret Key Agreement for Finite Linear Sources 2120 One-Shot Randomized and Nonrandomized Partial Decoupling 1076 Online Energy-Efficient Scheduling for Timely Information Downloads in Mobile Networks 1810 Online Learning with Diverse User Preferences 1947 ON-OFF Privacy with Correlated Requests 1781 Operational Equivalence of Distributed Hypothesis Testing and Identification Systems 1513 Opportunistic Topological Interference Management 1221 Optimal Age over Erasure Channels 1523 Optimal coded caching under statistical QoS information 1771 Optimal Index Codes for Some Interlinked Cycle Structures with Outer Cycles 1685 Optimal k-Deletion Correcting Codes 1376 Optimal Mechanism for Randomized Responses under Universally Composable Security Measure 1243 Optimal Multiple Assignment Schemes Using Ideal Multipartite Secret Sharing Schemes 1311 Optimal Multiplexed Erasure Codes for Streaming Messages with Different Decoding Delays 1161 Optimal Privacy-Utility Trade-off under a Rate Constraint 1520 Optimal Resource Allocation for Cellular Networks with Joint Decoding over Virtual Cells 1072 Optimal Scalar Linear Codes for a Class of Jointly Extended Groupcast Index Coding Problems 1113 Optimal Secure GDoF of Symmetric Gaussian Wiretap Channel with a Helper 1309 Optimal Streaming Erasure Codes over the Three-Node Relay Network 1527 Optimality of the Plug-in Estimator for Differential Entropy Estimation under Gaussian Convolutions 1509 Optimal-Rate Characterisation for Pliable Index Coding using Absent Receivers 1786 Optimizing Bounds on the Classical Information Rate of Quantum Channels with Memory 1712 Orthogonal Precoder for Integer-Forcing MIMO 1087 Overlapping Multi-Bandit Best Arm Identification 1462 Packet Efficiency of BATS Coding on Wireless Relay Network with Overhearing 2133 Pareto Optimal Schemes in Coded Caching 1917 Perfect Codes in Euclidean Lattices: Bounds and Case Studies 1935 Permutation Code Equivalence is Not Harder Than Graph Isomorphism When Hulls Are Trivial 2081 Permutation Recovery from Multiple Measurement Vectors in Unlabeled Sensing 1228 Permutation-based Decoding of Reed-Muller Codes in Binary Erasure Channel 1220 Phase Transition in Mixed 𝓁₂/𝓁₁-norm Minimization for Block-Sparse Compressed Sensing 1825 Polar Codes for the Deletion Channel: Weak and Strong Polarization 1325 Polar Coding for Common Message Only Wiretap Broadcast Channel 1079 Polar Coding for Parallel Gaussian Channels 1532 Polynomial Linear System Solving with Errors by Simultaneous Polynomial Reconstruction of Interleaved Reed-Solomon Codes. 1356 Polynomial-time Capacity Calculation and Scheduling for Half-Duplex 1-2-1 Networks 1350 Practical Functional Regenerating Codes for Broadcast Repair of Multiple Nodes 1700 Predicate Privacy and List Privacy for a rho-Recoverable Function 1711 Privacy Against Brute-Force Inference Attacks 1231 Privacy Amplification, Lossy Compression, and their Duality to Channel Coding 2062 Private Computation with Side Information: The Single-Server Case 1120 Private Information Retrieval from Decentralized Uncoded Caching Databases 1702 Private Information Retrieval from Heterogeneous Uncoded Caching Databases 1348 Private Information Retrieval from Locally Repairable Databases with Colluding Servers 1194 Private Information Retrieval from Non-Replicated Databases 2063 Private Inner Product Retrieval for Distributed Machine Learning 2020 Private Polynomial Computation for Noncolluding Coded Databases 1017 Private Polynomial Computation from Lagrange Encoding 1197 Private Proximity Retrieval 1966 Private Secure Coded Computation 1837 Private Shotgun DNA Sequencing 1558 Probabilistic Forwarding of Coded Packets on Networks 1979 Procedure for Identifying Odd-sized Nucleotide Sequences as Codewords of BCH Codes over GF(4) 1975 Profile-based Privacy for Locally Private Computations 1236 Progressive Module Minimization for Re-encoding Transformed Soft Decoding of RS Codes 1788 Proof of Two Conjectures on Error Exponents for Asynchronous Multiple Access Channel 2025 Properties of Scaled Noncommutative Rényi and Augustin Information 1704 Provable Subspace Tracking with Missing Entries 1586 Proving Erasure 1823 Pseudocodeword-based Decoding of Quantum Stabilizer Codes 1557 Publicness, Privacy and Confidentiality in the Single-Serving Quantum Broadcast Channel 1250 Puncturing and Shortening for Polar Codes via the Partial Order by Binary Domination 1902 Quantized Mechanisms for Gaussian Multiple Access Wiretap Channels 2031 Quantizing Signals for Linear Classification 1378 Quantum Coding via Semidefinite Programming 1593 Quasi-Cyclic LDPC Codes for Correcting Multiple Phased Bursts of Erasures 1458 Quasi-static fading MAC with many users and finite payload 1425 Querying Policies Based on Sparse Matrices for Noisy 20 Questions 1811 Queue Management for Age Sensitive Status Updates 1893 Quickest Detection of a Moving Target in a Sensor Network 1596 Quickest Search for a Change Point 1819 Rateless Codes for Distributed Computations with Sparse Compressed Matrices 2100 Rate-Memory Trade-off for Multi-access Coded Caching with Uncoded Placement 1563 Rates of Adaptive Group Testing in the Linear Regime 1936 Real-time Binary Posterior Matching 1739 Reconstruction of Sequences in DNA Storage 1741 Recovery of Structured Signals From Corrupted Non-Linear Measurements 1574 Recursive projection-aggregation decoding of Reed-Muller codes 1224 Reduce Transmission Delay for Caching-Aided Two-Layer Network 1764 Reduced Complexity Index Codes and Improved Upperbound on Broadcast Rate for Neighboring Interference Problems 2121 Reduced complexity window processing of binary polarization kernels 1548 Reed-Solomon Codes over Fields of Characteristic Zero 1896 Refinement of Massey Inequality 1416 Relaxed Locally Correctable Codes in Computationally Bounded Channels 1514 Relaying One Bit Across a Tandem of Binary-Symmetric Channels 2045 Remarks on Rényi versions of conditional entropy and mutual information 1168 Rényi Entropy Power Inequalities of Order $r \in (0, 1)$ for s-concave Densities 1805 Repeat-Free Codes 1624 RLS-Based Detection for Massive Spatial Modulation MIMO 1316 Robust Gradient Descent via Moment Encoding and LDPC Codes 1565 Robustness of Maximal α-Leakage to Side Information 1262 Saddlepoint Approximations for Noncoherent Single-Antenna Rayleigh Block-Fading Channels 1706 Sample Complexity Bounds for Low-Separation-Rank Dictionary Learning 1882 Sample-Measurement Tradeoff in Support Recovery Under a Subgaussian Prior 1515 Scalable Automated Proving of Information Theoretic Inequalities with Proximal Algorithms 1130 Scalable Information Flow Analysis of Secure Three-Party Affine Computations 1338 Scalable Network-Coded PBFT Consensus Algorithm 1604 Scheduling to Minimize Age of Synchronization in Wireless Broadcast Networks with Random Updates 1725 Searching for Highly Nonlinear DPA-Resistant Balanced Boolean Functions in the Rotation Symmetric Class 1124 Second-Order Asymptotically Optimal Statistical Classification 1317 Second-Order Characterizations via Partial Smoothing 1976 Secret key distillation over a pure loss quantum wiretap channel under restricted eavesdropping 1578 Secret Key Generation via Pulse-Coupled Synchronization 2001 Secure Broadcasting of Two Encrypted Sources under Side-Channel Attacks 1354 Secure Determinant Codes: A Class of Secure Exact-Repair Regenerating Codes 1697 Secure Estimation under Causative Attacks 1216 Secure list decoding 1248 Secure Multiterminal Source Coding With Actions 1569 Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys 1014 Security Analysis of Compressed Encryption With Sparse Matrices Against Chosen Plaintext Attacks 1053 Semi-Finite Length Analysis for Secure Random Number Generation 1106 Sequence-Subset Distance and Coding for Error Control for DNA-based Data Storage 2109 Sequential anomaly detection with observation control 1387 Sequential Change Detection Based on Universal Compression for Markov Sources 1389 Set-Codes with Small Intersections and Small Discrepancies 1487 Shallow Neural Network can Perfectly Classify an Object following Separable Probability Distribution 1848 Shannon Capacity is Achievable for a Large Class of Interactive Markovian Protocols 2029 Shared Randomness in Arbitrarily Varying Channels 1461 Simple Codes and Sparse Recovery with Fast Decoding 1305 Simultaneous transmission of classical and quantum information under channel uncertainty and jamming attacks 1258 Single-Error Detection and Correction for Duplication and Substitution Channels 2058 Single-Server Multi-Message Individually-Private Information Retrieval with Side Information 2138 Single-Server Single-Message Online Private Information Retrieval with Side Information 1642 Slice Sampling for Lattice Gaussian Distribution 1583 Solving linear inverse problems using generative models 2087 Some Enumeration Problems in the Duplication-Loss Model of Genome Rearrangement 1063 Source resolvability problem with respect to a certain subclass of f-divergence 2068 SPARCs and AMP for Unsourced Random Access 2135 Sparse Covariance Estimation from Quadratic Measurements: A Precise Analysis 1539 Sparse Non-Negative Recovery from Shifted Symmetric Subgaussian Measurements using NNLS 1970 Spatial Soft-Core Caching 1393 Spatially Coupled LDPC Codes via Partial Superposition 1399 Spectral Bounds for Quasi-Twisted Codes 1891 Speeding up decoding a code with a non-trivial automorphism group up to an exponential factor 1504 Speeding Up Distributed Gradient Descent by Utilizing Non-persistent Stragglers 1420 Stabilizer codes from modified symplectic forms 2009 State Estimation via Worst-Case Erasure and Symmetric Channels with Memory 1207 Statistical Learning Aided Decoding of BMST Tail-Biting Convolutional Code 1099 Status from a Random Field: How Densely Should One Update? 1707 Steganography Protocols for Quantum Channels 1261 Stein's Lemma for Classical-Quantum Channels 1267 Stochastic Decision with Stationary Memoryless Sequence 2036 Strengthened Information-theoretic Bounds on the Generalization Error 2150 Strong Chain Rules for Min-Entropy under Few Bits Spoiled 1028 Strong Converse for Hypothesis Testing Against Independence over a Two-Hop Network 1582 Structure Learning of Similar Ising Models: Information-theoretic Bounds 1419 Structured Coding for Authentication in the Presence of a Malicious Adversary 1314 Subadditivity Beyond Trees and the Chi-Squared Mutual Information 2097 Subspace Coding for Coded Caching: Decentralized and Centralized Placements Meet for Three Users 2012 Successive Cancellation Decoding of Polar Codes for Insertion/Deletion Error Correction 1968 Successive Refinement to Caching for Dynamic Content 1745 Symbolwise MAP for Multiple Deletion Channels 1300 Symmetric Private Information Retrieval with Mismatched Coded Messages and Randomness 1206 Synthesizing Differentially Private Datasets using Random Mixing 2040 Systematic Construction of MDS Codes with Small Sub-packetization Level and Near Optimal Repair Bandwidth 1998 Systematic Matrix Multiplication Codes 2095 Tail redundancy and its characterizations of universal compression 1910 Task-Based Quantization for Recovering Quadratic Functions Using Principal Inertia Components 1866 Teaching and learning in uncertainty 1000 Test 1872 The Asymptotic Complexity of Coded-BKW with Sieving Using Increasing Reduction Factors 1254 The Capacity of Count-Constrained ICI-Free Systems 2134 The Capacity of Multi-round Private Information Retrieval from Byzantine Databases 1824 The Capacity of Private Sequential Computation 1134 The Capacity Region of the Arbitrarily Varying MAC: With and Without Constraints 1198 The CEO Problem with rth Power of Difference Distortion 1260 The Complete Hierarchical Locality of the Punctured Simplex Code 1776 The Degraded Gaussian Many-Access Wiretap Channel 1873 The Degrees of Freedom of MIMO Relay under Coherence Diversity 1345 The Dirty Paper Wiretap Feedback Channel with or without Action on the State 2091 The Discrete-Time Poisson Optical Wiretap Channel with Peak Intensity Constraint 1508 The Encoding and Decoding Complexities of Entanglement-Assisted Quantum Stabilizer Codes 1969 The Exact Capacity-Memory Tradeoff for Caching with Uncoded Prefetching in the Two-Receiver Gaussian Broadcast Channel 1119 The F_M-linear Complexity of M-ary Sidel’nikov Sequences of Period p−1 = f ·M^λ 1926 The Geometry of Community Detection via the MMSE Matrix 1783 The Group Restricted Isometry Property for Subgaussian Block Diagonal Matrices 1192 The Hat Guessing Number of Graphs 2122 The Interplay Between Block Design and Channel Estimation in VLC Systems 1564 The Interplay of Causality and Myopia in Adversarial Channel Models 1154 The Levenshtein's Channel and the List Size in Information Retrieval 2055 The Optimal Power Control Policy for an Energy Harvesting System with Look-Ahead: Bernoulli Energy Arrivals 1238 The punctured Dodecacode is uniformly packed 1653 The Rate Distortion Test of Normality 1965 The Symmetric Capacity of the $K$-Receiver Interleaved Broadcast Channel with Symmetric Side Information 1226 Throughput Scaling of Covert Communication over Wireless Adhoc Networks 1244 Tightening Mutual Information Based Bounds on Generalization Error 1736 Timely Coded Computing 1037 Time-universal data compression and prediction 1689 Towards a non-stochastic information theory 1950 Towards an Algebraic Network Information Theory: Distributed Lossy Computation of Linear Functions 1865 Towards an Extremal Network Theory – Robust GDoF Gain of Transmitter Cooperation over TIN 2039 Towards Jointly Optimal Placement and Delivery: To Code or Not to Code in Wireless Caching Networks 1834 Towards Theoretically-Founded Learning-Based Denoising 1577 Tradeoff Between Delay and High SNR Capacity in Quantized MIMO Systems 1026 Trading off Weak-Noise Estimation Performance and Outage Exponents in Nonlinear Modulation 2092 Tree Gradient Coding 1380 Turing Computability of the Fourier Transform of Bandlimited Functions 1375 Two-Stage Guessing 1634 Undetectable Radios: Covert Communication under Spectral Mask Constraints 1165 Undirected Unicast Network Capacity: A Partition Bound 1253 Unifying the Brascamp-Lieb Inequality and the Entropy Power Inequality 1831 Unique Information and Secret Key Decompositions 1470 Universal D-Semifaithfull Coding for Countably Infinite Alphabets 1510 Universal Learning of Individual Data 1233 Universal Polarization for Processes with Memory 2094 Universal Privacy Guarantees for Smart Meters 1183 Universal Randomized Guessing with Application to Asynchronous Decentralized Brute-Force Attacks 1719 Universally Decodable Matrices for Distributed Matrix-Vector Multiplication 1431 Universally Sparse Hypergraphs with Applications to Coding Theory 1346 Unrestricted Generalized Column Distances: A wider definition 1801 Untrusted Caches in Two-layer Networks 1394 Update Bandwidths for Distributed Storage 1955 Updates with Multiple Service Classes 1283 Using algebraic structures to improve LDPC code reconstruction over a noisy channel 1915 Using Erasure Feedback for Online Timely Updating with an Energy Harvesting Sensor 1836 Using Quantization to Deploy Heterogeneous Nodes in Two-Tier Wireless Sensor Networks 1640 Variable-length Coding Error Exponents with Noisy Feedback for the AWGN Channel at Zero-Rate 1071 Variable-length compression and secrecy by design 1473 Vector Gaussian Successive Refinement With Degraded Side Information 1502 Weakly-Private Information Retrieval 1609 Weight Enumerating Function, Number of Full Rank Sub-matrices and Network Coding 1229 Weights which respect support and NN-decoding 1074 When a Heavy Tailed Service Minimizes Age of Information 1852 When are large codes possible for AVCs? 1536 Whittle Index Policy for Multichannel Scheduling in Queueing Systems 1889 Wiretap Secret Key Capacity of Tree-PIN 1493 Wyner's Network on Caches: Combining Receiver Caching with a Flexible Backhaul 1374 Zero Correlation Zone Sequences from a Unified Construction of Perfect Polyphase Sequences