on Information Theory

Following is the list of accepted ISIT 2020 papers, sorted by paper title. You can use the search feature of your web browser to find your paper number. Notifications to all authors have also been sent by email. If you have not received your notification of the results by email, please contact us at papers@2020.ieee-isit.org.

Paper ID | Paper Title |
---|---|

1635 | "Wireless Paint": Code Design for 3D Orientation Estimation with Backscatter Arrays |

1510 | $O(\log \log n)$ Worst-Case Local Decoding and Update Efficiency for Data Compression |

1040 | 2D Local Hamiltonian with Area Laws is QMA-Complete |

1965 | A Better Bound Gives a Hundred Rounds: Enhanced Privacy Guarantees via f-Divergences |

1935 | A Combinatorial View of the Service Rates of Codes Problem, its Equivalence to Fractional Matching and its Connection with Batch Codes |

1662 | A compression perspective on secrecy measures |

1303 | A Connection between Feedback Capacity and Kalman Filter for Colored Gaussian Noises |

1824 | A Fair Classifier Using Mutual Information |

1206 | A Four-Qubits Code that is a Quantum Deletion Error-Correcting Code with the Optimal Length |

1985 | A Functional Construction of Codes for Multiple Access and Broadcast Channels |

1203 | A Game-Theoretic Approach to Sequential Detection in Adversarial Environments |

1625 | A General Derivative Identity for the Conditional Mean Estimator in Gaussian Noise and Some Applications |

1962 | A Geometric View of the Service Rates of Codes Problem and its Application to the Service Rate of the First Order Reed-Muller Codes |

1403 | A High-SNR Normal Approximation for MIMO Rayleigh Block-Fading Channels |

1084 | A Hoeffding Inequality For Finite State Markov Chains and its Applications to Markovian Bandits |

1585 | A Local Characterization for Wyner Common Information |

1151 | A Low Complexity Decoding Algorithm for NB-LDPC Codes over Quadratic Extension Fields |

1592 | A New Construction of QAM Golay Complementary Sequence Pair |

1712 | A New Design Framework on D2D Coded Caching with Optimal Rate and Less Subpacketizations |

1383 | A New High-Dimensional Quantum Entropic Uncertainty Relation with Applications |

1119 | A Novel B-MAP Proxy for Greedy Sparse Signal Recovery Algorithms |

1726 | A Novel Design of Spatially Coupled LDPC Codes for Sliding Window Decoding |

1608 | A Polar Code Based TIN-SIC Scheme for the Unsourced Random Access in the Quasi-Static Fading MAC |

1191 | A Tight Uniform Continuity Bound for Equivocation |

1811 | A Two-way QKD Protocol Outperforming One-way Protocols at Low QBER |

1410 | A Universal Data Compression Scheme based on the AIVF Coding Techniques |

1097 | A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs |

1192 | Access Balancing in Storage Systems by Labeling Partial Steiner Systems |

1293 | Access-optimal Linear MDS Convertible Codes for All Parameters |

1535 | Achievability Bounds for Community Detection and Matrix Completion with Two-Sided Graph Side-Information |

1987 | Achievability of nearly-exact alignment for correlated Gaussian databases |

1873 | Achievable Rates for Strategic Communication |

1852 | Active Covert Sensing |

1396 | Active Learning for Classification with Abstention |

1140 | Adaptive Coding for Two-Way Lossy Source-Channel Communication |

1252 | Adaptive Procedures for Discriminating Between Arbitrary Tensor-Product Quantum States |

1519 | Additivity in Classical-Quantum Wiretap Channels |

1941 | Age of Information in Random Access Channels |

1382 | Age of Information in Uncoordinated Unslotted Updating |

1680 | Age-of-Information Revisited: Two-way Delay and Distribution-oblivious Online Algorithm |

1997 | Aggregate Message Authentication Codes with Detecting Functionality from Biorthogonal Codes |

1318 | An Achievable Region for the Multiple Access Wiretap Channels with Confidential and Open Messages |

1067 | An Alphabet-Size Bound for the Information Bottleneck Function |

1360 | An Efficient Algorithm for Designing Optimal CRCs for Tail-Biting Convolutional Codes |

1614 | An Efficient Neural Network Architecture for Rate Maximization in Energy Harvesting Downlink Channels |

1797 | An Efficient Running Quantile Estimation Technique alongside Correntropy for Outlier Rejection in Online Regression |

1971 | An Explicit Formula for the Zero-Error Feedback Capacity of a Class of Finite-State Additive Noise Channels |

1316 | An Ideal Secret Sharing Scheme Realizing an Access Structure Based on a Finite Projective Plane of Order 3 |

1788 | An Improved Regret Bound for Thompson Sampling in the Gaussian Linear Bandit Setting |

1481 | An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption |

1345 | An Optimal Linear Error Correcting Scheme for Shared Caching with Small Cache Sizes |

1658 | An Upper Bound on the Capacity-Memory Tradeoff of Interleavable Discrete Memoryless Broadcast Channels with Uncoded Prefetching |

1471 | Analog Subspace Coding: A New Approach to Coding for Non-Coherent Wireless Networks |

1791 | Analysis of Absorbing Sets using Cosets and Syndromes |

1291 | Analysis of K Nearest Neighbor KL Divergence Estimation for Continuous Distributions |

1947 | Analytic Study of Double Descent in Binary Classification: The Impact of Loss |

1409 | AoI Minimization in Broadcast Channels with Channel State Information |

1165 | Approaching Capacity Without Pilots via Nonlinear Processing at the Edge |

1886 | Approximate Gács-Körner Common Information |

1424 | Approximate Recovery Of Ising Models with Side Information |

1259 | Arbitrarily Varying Wiretap Channels with Non-Causal Side Information at the Jammer |

1131 | Array Codes for Functional PIR and Batch Codes |

1249 | Asymptotic Absorbing Set Enumerators for Non-Binary Protograph-Based LDPC Code Ensembles |

1378 | Asymptotically Optimal Scheduling Policy For Minimizing The Age of Information |

1722 | Asymptotically Scale-invariant Multi-resolution Quantization |

1821 | Asymptotics of Quickest Change Detection with an Energy Harvesting Sensor |

1545 | Asynchronous Polar-Coded Modulation |

1619 | Authentication with Mildly Myopic Adversaries |

1488 | Average Age of Information for a Multi-Source M/M/1 Queueing Model With Packet Management |

1025 | Bee-Identification Error Exponent with Absentee Bees |

1579 | Best Relay Selection in Gaussian Half-Duplex Diamond Networks |

1055 | Beyond Max-SNR: Joint Encoding for Reconfigurable Intelligent Surfaces |

1574 | Binary Hypothesis Testing with Deterministic Finite-Memory Decision Rules |

1484 | Binary Subblock Energy-Constrained Codes: Knuth’s Balancing and Sequence Replacement Techniques |

1086 | Biometric and Physical Identifiers with Correlated Noise for Controllable Private Authentication |

1885 | Bivariate Polynomial Coding for Straggler Exploitation with Heterogeneous Workers |

1189 | Bounding the Achievable Region of Sparse NOMA |

1514 | Bounds for the capacity error function for unidirectional channels with noiseless feedback |

1358 | Bounds on Permutation Channel Capacity |

1958 | Broadcasting on trees near criticality |

1256 | Bursty Wireless Networks of Bounded Capacity |

1802 | Cache-aided Multiuser Private Information Retrieval |

1398 | Cache-Aided Scalar Linear Function Retrieval |

1267 | Capacity Bounds for Amplitude-Constrained AWGN MIMO Channels with Fading |

1413 | Capacity Bounds for Communication Systems with Quantization and Spectral Constraints |

1639 | Capacity of Continuous Channels with Memory via Directed Information Neural Estimator |

1205 | Capacity of Line-of-Sight MIMO Channels |

1689 | Capacity of Multicarrier Faster-than-Nyquist Signaling |

1659 | Capacity of Quantum Private Information Retrieval with Colluding Servers |

1503 | Capacity per Unit-Energy of Gaussian Random Many-Access Channels |

1859 | Capacity Region of the Gaussian Arbitrarily-Varying Broadcast Channel |

1931 | Capacity-achieving Polar-based LDGM Codes with Crowdsourcing Applications |

1938 | Channel Models, Favorable Propagation and Multi-Stage Linear Detection in Cell-Free Massive MIMO |

1404 | Characterization of Conditional Independence and Weak Realizations of Multivariate Gaussian Random Variables: Applications to Networks |

1454 | Characterizing the Bethe Partition Function of Double-Edge Factor Graphs via Graph Covers |

1264 | Classical Coding Problem from Transversal T Gates |

1942 | Classical Mechanism is Optimal in Classical-Quantum Differentially Private Mechanisms |

1146 | Clustering piecewise stationary processes |

1194 | Coded Computation Against Straggling Channel Decoders in the Cloud for Gaussian Channels |

1539 | Coded Computing in Unknown Environment via Online Learning |

1858 | Coded Data Rebalancing: Fundamental Limits and Constructions |

1803 | Coded QR Decomposition |

1621 | Codes Correcting Synchronization Errors for Symbol-Pair Read Channels |

1109 | Codes over Trees |

1893 | Coding for Efficient DNA Synthesis |

1281 | Coding for Optimized Writing Rate in DNA Storage |

1113 | Coding for Sequence Reconstruction for Single Edits |

1108 | CodNN – Robust Neural Networks From Coded Classification |

1288 | Coherent Quantum Channel Discrimination |

1672 | Communication Efficient and Byzantine Tolerant Distributed Learning |

1701 | Communication Efficient Distributed Approximate Newton Method |

1136 | Communication Efficient Secret Sharing in the Presence of Malicious Adversary |

1101 | Communication over Quantum Channels with Parameter Estimation |

1861 | Communication-Efficient Gradient Coding for Straggler Mitigation in Distributed Learning |

1746 | Community Detection with Secondary Latent Variables |

1787 | Comparison of Information Structures for Zero-Sum Games in Standard Borel Spaces |

1434 | Complete Characterization of Optimal LRCs with Minimum Distance 6 and Locality 2: Improved Bounds and Constructions |

1876 | Complexity of Estimating R´enyi Entropy of Markov Chains |

1392 | Computability of the Zero-Error capacity with Kolmogorov Oracle |

1098 | Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels |

1598 | Computational Code-Based Single-Server Private Information Retrieval |

1652 | Computing the Partition Function of the Sherrington-Kirkpatrick Model is Hard on Average |

1130 | Concave Aspects of Submodular Functions |

1279 | Conditional Disclosure of Secrets: A Noise and Signal Alignment Approach |

1428 | Constrained Functional Value under General Convexity Conditions with Applications to Distributed Simulation |

1540 | Construction of Rate (n-1)/n Non-Binary LDPC Convolutional Codes via Difference Triangle Sets |

1636 | Constructions of Complex Codebooks Asymptotically Meeting the Welch Bound: A Graph Theoretic Approach |

1661 | Constructions of Nonequivalent Fp-Additive Generalised Hadamard Codes |

1967 | Constructions of Two-Dimensional Golay Complementary Array Pairs Based on Generalized Boolean Functions |

1737 | Continuity of Generalized Entropy |

1896 | Cost of Guessing: Applications to Data Repair |

1138 | Covering Codes for Insertions and Deletions |

1251 | CRC-Aided Belief Propagation List Decoding of Polar Codes |

1107 | Cross Z-Complementary Pairs (CZCPs) for Optimal Training in Broadband Spatial Modulation Systems |

1210 | Crowdsourced Classification with XOR Queries: An Algorithm with Optimal Sample Complexity |

1645 | Cyclic LRC codes with hierarchy and availability |

1433 | Data Deduplication with Random Substitutions |

1772 | Data Freshness in Leader-Based Replicated Storage |

1091 | Data-Driven Ensembles for Deep and Hard-Decision Hybrid Decoding |

1604 | Data-Driven Factor Graphs for Deep Symbol Detection |

1557 | Data-Driven Representations for Testing Independence: A Connection with Mutual Information Estimation |

1299 | Decentralized sequential active hypothesis testing and the MAC feedback capacity |

1589 | Decoding Reed–Muller Codes Using Redundant Code Constraints |

1368 | Delay-Optimal Coding for Secure Transmission over Parallel Burst Erasure Channels with an Eavesdropper |

1648 | Detecting an Odd Restless Markov Arm with a Trembling Hand |

1647 | Diamond Message Set Groupcasting: From an Achievable Rate Region for the DM Broadcast Channel to the Capacity of the Combination Network |

1219 | Discrete Optimal Reconstruction Distributions for Itakura-Saito Distortion Measure |

1897 | Discrete Water Filling Multi-Path Packet Scheduling |

1516 | Distributed Secure Storage: Rate-Privacy Trade-Off and XOR-Based Coding Scheme |

1759 | Distributed State Estimation with Bounded Errors over Multiple Access Channels |

1260 | Distribution of the Minimal Distance of Random Linear Codes |

1615 | Distribution Privacy Under Function Recoverability |

1070 | DoF Analysis for Multipath-Assisted Imaging: Single Frequency Illumination |

1272 | DoF Region of the Decentralized MIMO Broadcast Channel—How many informed antennas do we need? |

1096 | Duplication with transposition distance to the root for q-ary strings |

1033 | Efficient Algorithm for the Linear Complexity of Sequences and Some Related Consequences |

1088 | Efficient Estimation of a Sparse Delay-Doppler Channel |

1431 | Efficient Maximum-Likelihood Decoding of Reed-Muller RM(m-3,m) Codes |

1980 | Eliminating Pairing Loss for Coded Caching with Three Erasure-Coded Servers |

1276 | Embedding Information in Radiation Pattern Fluctuations |

1365 | Empirical Properties of Good Channel Codes |

1734 | Entangled Polynomial Codes for Secure, Private, and Batch Distributed Matrix Multiplication: Breaking the ''Cubic'' Barrier |

1123 | Entanglement-Assisted Data Transmission as an Enabling Technology: A Link-Layer Perspective |

1072 | Entropy of a Quantum Channel: Definition, Properties, and Application |

1406 | Entropy property testing with finitely many errors |

1473 | Equivalence of ML decoding to a continuous optimization problem |

1875 | Error Detection and Correction in Communication Networks |

1477 | Error Rate Analysis for Random Linear Streaming Codes in the Finite Memory Length Regime |

1423 | Error-correcting Codes for Short Tandem Duplication and Substitution Errors |

1567 | Estimation of Modal Decompositions |

1099 | Evaluation of Error Probability of Classification Based on the Analysis of the Bayes Code |

1953 | Evasive Active Hypothesis Testing |

1037 | Exact Expressions in Source and Channel Coding Problems Using Integral Representations |

1375 | Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel |

1207 | Explicit Construction of Multiple Access Channel Resolvability Codes from Source Resolvability Codes |

2004 | Explicit Renyi Entropy for Hidden Markov Models |

1152 | Exploring Unique Relevance for Mutual Information based Feature Selection |

1372 | Exponentially Fast Concentration of Vector Approximate Message Passing to its State Evolution |

1816 | Extending the Optimality Range of Multi-Antenna Coded Caching with Shared Caches |

1904 | Factored LT and Factored Raptor Codes for Large-Scale Distributed Matrix Multiplication |

1969 | Fast Compressive Large-Scale Matrix-Matrix Multiplication Using Product Codes |

1485 | Fast Soft Decision Decoding of Linear Block Codes Using Partial Syndrome Search |

1949 | Federated Recommendation System via Differential Privacy |

1810 | Feedback Capacity of Finite-State Channels with Causal State Known at the Encoder |

1593 | Feedback Channel Communication with Low Precision Arithmetic |

1657 | Fidelity of Finite Length Quantum Codes in Qubit Erasure Channel |

1393 | Finite Key Analysis of the Extended B92 Protocol |

1702 | Finite-Blocklength and Error-Exponent Analyses for LDPC Codes in Point-to-Point and Multiple Access Communication |

1015 | Finite-Blocklength Performance of Sequential Transmission over BSC with Noiseless Feedback |

1631 | From Feedback Capacity to Tight Achievable Rates without Feedback for AGN Channels with Stable and Unstable Autoregressive Noise |

1725 | Functional Error Correction for Reliable Neural Networks |

1104 | Fundamental limitations on secret key agreement over a quantum network |

1229 | Fundamental Limits of Age-of-Information in Stationary and Non-stationary Environments |

1877 | Fundamental limits of distributed encoding |

1995 | Fundamental limits of distributed tracking |

1676 | Fundamental Limits of Wireless Caching Under Mixed Cacheable and Uncacheable Traffic |

1708 | Gaussian 1-2-1 Networks with Imperfect Beamforming |

1459 | Gaussian Multiple and Random Access in the Finite Blocklength Regime |

1711 | Gaussian Multiterminal Source-Coding with Markovity: An Efficiently-Computable Outer Bound |

1715 | GCSA Codes with Noise Alignment for Secure Coded Multi-Party Batch Matrix Multiplication |

1102 | General Mixed State Quantum Data Compression with and without Entanglement Assistance |

1325 | Generalization Error Bounds via the Central Moments and Tail of the Information Density |

1783 | Generalized LDPC Codes with Convolutional Code Constraints |

1649 | Generic Decoding in the Sum-Rank Metric |

2002 | Graceful degradation over the BEC via non-linear codes |

1263 | Grassmannian Frames in Composite Dimensions by Exponentiating Quadratic Forms |

1095 | Gray-Wyner and Slepian-Wolf Guessing |

1384 | Group Testing with Runlength Constraints for Topological Molecular Storage |

1952 | Guesswork with Quantum Side Information: Optimal Strategies and Aspects of Security |

1940 | Hardness of Successive-Cancellation Decoding of Linear Codes |

1682 | Heterogeneous Computation Assignments in Coded Elastic Computing |

1377 | Heterogeneous Distributed Computation |

1950 | Hiding Identities: Estimation Under Local Differential Privacy |

1628 | Hierarchical Coded Gradient Aggregation for Learning at the Edge |

1370 | High-dimensional rank-one nonsymmetric matrix decomposition: the spherical case |

1784 | How else can we define Information Flow in Neural Circuits? |

1612 | Hypergraph-based Coding Schemes for Two Source Coding Problems under Maximal Distortion |

1356 | Hypothesis Testing Against Independence Under Gaussian Noise |

1502 | Improved Achievable Regions in Networked Scalable Coding Problems |

1435 | Improved Belief Propagation List Decoding for Polar Codes |

1464 | Improved Computation-Communication Trade-Off for Coded Distributed Computing using Linear Dependence of Intermediate Values |

1090 | Improved efficiency for explicit covering codes matching the sphere-covering bound |

1532 | Improved non-adaptive algorithms for threshold group testing with a gap |

1198 | Incremental ADMM with Privacy-Preservation for Decentralized Consensus Optimization |

1531 | Infinite-fold enhancement in communications capacity using pre-shared entanglement |

1934 | Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover |

1122 | Information-Energy Capacity Region for SWIPT Systems with Power Amplifier Nonlinearity |

1128 | Information-theoretic analysis for transfer learning |

1690 | Information-theoretic limits of a multiview low-rank symmetric spiked matrix model |

1417 | Interference Management without CSIT: A Broadcast Approach |

1804 | Interleaved Block Coding for Achieving Gaussian Random Access Channel Capacity |

1163 | Isomorphism Problem Revisited: Information Spectrum Approach |

1414 | Iterative Decoding of Non-Binary Cyclic Codes Using Minimum-Weight Dual Codewords |

1075 | k-Connectivity in Random Graphs induced by Pairwise Key Predistribution Schemes |

1313 | Keyless Covert Communication in the Presence of Channel State Information |

1314 | Latent Factor Analysis of Gaussian Distributions under Graphical Constraints |

1632 | Latent-variable Private Information Retrieval |

1887 | Lattice Construction C* built from Self-Dual Codes |

1793 | Learned Scheduling of LDPC Decoders Based on Multi-armed Bandits |

1364 | Learning a Neural-Network Controller for a Multiplicative Observation Noise System |

1582 | Learning Additive Noise Channels: Generalization Bounds and Algorithms |

1447 | Learning Representations by Maximizing Mutual Information in Variational Autoencoders |

1822 | Lifted Reed-Solomon Codes with Application to Batch Codes |

1114 | Limit Distribution for Smooth Total Variation and 𝛘²-Divergence in High Dimensions |

1506 | Limits on Gradient Compression for Stochastic Optmization |

1719 | Linear and Range Counting under Metric-based Local Differential Privacy |

1898 | Linear Models are Most Favorable among Generalized Linear Models |

1492 | Linear Network Error Correction Coding Revisited |

1624 | Linear programming bounds for quantum amplitude damping codes |

1440 | Linear-Time Erasure List-Decoding of Expander Codes |

1085 | List Decoding for Oblivious Arbitrarily Varying MACs: Constrained and Gaussian |

1911 | List decoding of Arikan's PAC codes |

1236 | List Decoding of Universal Polar Codes |

1789 | Local Re-encoding for Coded Matrix Multiplication |

1080 | Locally Balanced Constraints |

1150 | Lossless Data Compression with Side Information: Nonasymptotics and Dispersion |

1118 | Lossy coding of a time-limited piece of a band-limited white Gaussian source |

1842 | Low Complexity Algorithms for Transmission of Short Blocks over the BSC with Full Feedback |

1954 | Low Complexity Distributed Computing via Binary Matrices with Extension to Stragglers |

1418 | Low-Complexity Chase Decoding of Reed-Solomon Codes with Module Minimization |

1371 | Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Power |

1227 | Macroscopic Analysis of Vector Approximate Message Passing in a Model Mismatch Setting |

1376 | Mass Error-Correction Codes for Polymer-Based Data Storage |

1681 | Max-affine Regression with Universal Parameter Estimation for Small-ball Designs |

1220 | Maximum Length of Robust Positioning Sequences |

1258 | Maximum Likelihood Decoding for Channels with Uniform Noise and Signal Dependent Offset |

1901 | Measurement Dependent Noisy Search with Stochastic Coefficients |

1675 | Mechanisms for Hiding Sensitive Genotypes with Information-Theoretic Privacy |

1173 | Message Flow Analysis in Practical LDPC Decoders for the Interpretation of Absorbing Set Thresholds |

1814 | Message-Passing Based Channel Estimation for Reconfigurable Intelligent Surface Assisted MIMO |

1983 | Minimax Lower Bounds for Circular Source Localization |

1968 | Minimax Prediction in Tree Ising Models |

1544 | Minimizing Age of Information via Hybrid NOMA/OMA |

1568 | Minimizing the alphabet size of erasure codes with restricted decoding sets |

1561 | Minimum Feedback for Collision-Free Scheduling in Massive Random Access |

1174 | Minimum Storage Rack-Aware Regenerating Codes with Exact Repair and Small Sub-Packetization |

1139 | Min-rank of Embedded Index Coding Problems |

1834 | Missing Mass of Markov Chains |

1132 | Mobility-Assisted Covert Communication over Wireless Ad Hoc Networks |

1963 | Model Projection: Theory and Applications to Fair Machine Learning |

1287 | Modulated Sparse Regression Codes |

1944 | Multi-Cast Channels with Hierarchical Flow |

1184 | Multi-Cell Mobile Edge Coded Computing: Trading Communication and Computing for Distributed Matrix Multiplication |

2000 | Multi-Label and Concatenated Neural Block Decoders |

1029 | Multi-layer Interference Alignment and GDoF of the K-User Asymmetric Interference Channel |

1193 | Multi-Product Dynamic Pricing in High-Dimensions with Heterogenous Price Sensitivity |

1785 | Multislot and Multistream Quickest Change Detection in Statistically Periodic Processes |

1543 | Multi-User Distillation of Common Randomness and Entanglement from Quantum States |

1216 | Near-Optimal Sparse Adaptive Group Testing |

1518 | Network Coding Based on Byte-wise Circular Shift and Integer Addition |

1511 | Network Information Theoretic Security |

1777 | New Formulas of Ergodic Feedback Capacity of AGN Channels Driven by Stable and Unstable Autoregressive Noise |

1594 | New Optimal Sets of Perfect Polyphase Sequences Based on Circular Florentine Arrays |

1306 | New Outer Bounds for the Two-Receiver Broadcast Channel |

1839 | Noise Recycling |

1021 | Noisy Guesses |

1899 | Noisy In-Memory Recursive Computation with Memristor Crossbars |

1918 | Non-Uniform Windowed Decoding For Multi-Dimensional Spatially-Coupled LDPC Codes |

1400 | Novel Converse for Device-to-Device Demand-Private Caching with a Trusted Server |

1655 | Numerically Stable Binary Gradient Coding |

1748 | Observational Learning with Fake Agents |

1427 | On a redundancy of AIFV-m codes for m=3,5 |

1334 | On Approximate Message Passing for Unsourced Access with Coded Compressed Sensing |

1204 | On Binary Statistical Classification from Mismatched Empirically Observed Statistics |

1656 | On Byzantine-Resilient High-Dimensional Stochastic Gradient Descent |

1577 | On D-ary Fano Codes |

1170 | On Discrete Signaling and Treating Interference as Noise for Complex Gaussian Interference Channels |

1677 | On Effective Stochastic Mechanisms for On-The-Fly Codebook Regeneration |

1626 | On Learning Parametric Non-Smooth Continuous Distributions |

1792 | On MIMO Gaussian Wiretap Channels with Optimal Energy Harvesting |

1599 | On Nonparametric Estimation of the Fisher Information |

1233 | On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes |

1878 | On Optimal Multi-user Beam Alignment in Millimeter Wave Wireless Systems |

1415 | On optimal weighted-sum rates for the modulo sum problem |

1144 | On parity-preserving variable-length constrained coding |

1129 | On Secrecy Key of a class of Secure Asymmetric Multilevel Diversity Coding System |

1320 | On the 2-Adic Complexity of A Class of Binary Sequences of Period 4p with Optimal Autocorrelation Magnitude |

1553 | On the Advantage of Irreversible Processes in Single-System Games |

1910 | On the alpha-loss Landscape in the Logistic Model |

1166 | On the AND-OR Interference Channel and the Sandglass Conjecture |

1975 | On the Broadcast Channel with Non-Distinct Message Demands and Symmetric Side Information |

1556 | On the Capacity of Deletion Channels with States |

1039 | On The Capacity of Gaussian MIMO Channels Under Interference Constraints |

1854 | On the Capacity of Intelligent Reflecting Surface Aided MIMO Communication |

1616 | On the Compressibility of Affinely Singular Random Vectors |

1651 | On the decoding of Barnes-Wall lattices |

1332 | On the Discussion Rate Region for the PIN Model |

1957 | On the Error Exponent of Approximate Sufficient Statistics for M-ary Hypothesis Testing |

1169 | On the Exact Lower Bounds of Encoding Circuit Sizes of Hamming Codes and Hadamard Codes |

1255 | On the Gap between Scalar and Vector Solutions of Generalized Combination Networks |

1082 | On the Information Leakage in Private Information Retrieval Systems |

1684 | On the Memory Requirements of Block Interleaver for Batched Network Codes |

1195 | On the number of factorizations of polynomials over finite fields |

1217 | On the Optimality of Two Decentralized Coded Caching Schemes With and Without Error Correction |

1234 | On the Partition Bound for Undirected Unicast Network Information Capacity |

1125 | On the Randomized Babai Point |

1916 | On the Rényi Entropy of Log-Concave Sequences |

1929 | On the Sample Complexity and Optimization Landscape for Quadratic Feasibility Problems |

1733 | On the Sample Complexity of Estimating Small Singular Modes |

1254 | On the Second- and Third-Order Asymptotics of Smooth Rényi Entropy and Their Applications |

1061 | On the Storage Cost of Private Information Retrieval |

1224 | On the structure of certain non-convex functionals and the Gaussian Z-interference channel |

1869 | On the Trackability of Stochastic Processes Based on Side Information |

1312 | On Top-k Selection from m-wise Partial Rankings via Borda Counting |

1196 | One shot approach to lossy source coding under average distortion constraints |

1704 | One-Shot Trade-Off Bounds for State Redistribution of Classical-Quantum Sources |

1475 | Online Estimation and Adaptation for Random Access with Successive Interference Cancellation |

1261 | Online Memorization of Random Firing Sequences by a Recurrent Neural Network |

1832 | Online Message Passing-based Inference in the Hierarchical Gaussian Filter |

1031 | Online Variational Message Passing in Hierarchical Autoregressive Models |

1993 | Online Versus Offline Rate in Streaming Codes for Variable-Size Messages |

1629 | Optimal Causal Rate-Constrained Sampling for a Class of Continuous Markov Processes |

1668 | Optimal Codes Correcting a Burst of Deletions of Variable Length |

1618 | Optimal Codes for the q-ary Deletion Channel |

1700 | Optimal Learning of Joint Alignments with a Faulty Oracle |

1242 | Optimal Locally Repairable Constacyclic Codes of Prime Power Lengths |

1808 | Optimal Multistage Group Testing Algorithm for 3 Defectives |

1714 | Optimal Restricted Isometry Condition for Exact Sparse Recovery with Orthogonal Least Squares |

1221 | Optimal Selective Encoding for Timely Updates with Empty Symbol |

1799 | Optimal Systematic t-Deletion Correcting Codes |

1308 | Optimal Two-Stage Bayesian Sequential Change Diagnosis |

1718 | Optimality of Least-squares for Classification in Gaussian-Mixture Models |

1671 | Optimality of Treating Inter-Cell Interference as Noise Under Finite Precision CSIT |

1116 | Optimizing the Transition Waste in Coded Elastic Computing |

1408 | Optimizing the Write Fidelity of MRAMs |

1302 | Optimum Source Resolvability Rate with Respect to f-Divergences Using the Smooth Renyi Entropy |

1744 | Partial MDS Codes with Local Regeneration |

1405 | Partial Updates: Losing Information for Freshness |

1501 | Partially Information Coupled Duo-Binary Turbo Codes |

1533 | Pattern-Based Analysis of Time Series: Estimation |

1439 | Perfect LRCs and k-Optimal LRCs |

1638 | Performance of Gaussian encodings for classical communication on correlated quantum phase-noise channels |

1154 | Permutation Enhances Classical Communication Assisted by Entangled States |

1333 | Poisson channel with binary Markov input and average sojourn time constraint |

1214 | Polar Codes with Balanced Codewords |

1741 | Polar Coding for the Wiretap Broadcast Channel with Multiple Messages |

1366 | Polarization in Attraction-Repulsion Models |

1915 | PolyShard: Coded Sharding Achieves Linearly Scaling Efficiency and Security Simultaneously |

1634 | Privacy Amplification of Iterative Algorithms via Contraction Coefficients |

1992 | Privacy-Utility Tradeoff in a Guessing Framework Inspired by Index Coding |

1664 | Private Computation with Individual and Joint Privacy |

1735 | Private Function Computation |

1522 | Private Information Retrieval Over Gaussian MAC |

1304 | Private Set Intersection Using Multi-Message Symmetric Private Information Retrieval |

1678 | Private Two-Terminal Hypothesis Testing |

1906 | Product Lagrange Coded Computing |

1549 | Proof of Convergence for Correct-Decoding Exponent Computation |

1641 | Provable Efficient Skeleton Learning of Encodable Discrete Bayes Nets in Poly-Time and Sample Complexity |

1528 | Pruning Neural Belief Propagation Decoders |

1202 | Q-ary Asymmetric LOCO Codes: Constrained Codes Supporting Flash Evolution |

1956 | Quadratic Privacy-Signaling Games and Payoff Dominant Equilibria |

1181 | Quadratically Constrained Two-way Adversarial Channels |

1178 | Quantification of Unextendible Entanglement and Its Applications in Entanglement Distillation |

1529 | Quantized Corrupted Sensing with Random Dithering |

1133 | Quantum Advantage via Qubit Belief-Propagation |

1038 | Quantum Blahut-Arimoto Algorithms |

1580 | Quantum Private Information Retrieval from MDS-coded and Colluding Servers |

1601 | Quantum State Redistribution for Ensemble Sources |

1329 | Queue-Aware Beam Scheduling for Half-Duplex mmWave Relay Networks |

1494 | Quickest Detection of a Dynamic Anomaly in a Heterogeneous Sensor Network |

1158 | Rank Preserving Code-based Signature |

1786 | Rate–Diversity Optimal Multiblock Space–Time Codes via Sum-Rank Codes |

1145 | Reconfigurable Surface Assisted Multi-User Opportunistic Beamforming |

1688 | Reconstruction of Multi-user Binary Subspace Chirps |

1028 | Reconstruction of Strings from their Substrings Spectrum |

1774 | Recovering Structure of Noisy Data through Hypothesis Testing |

1032 | Recovery Sets for Subspaces from a Vector Space |

1369 | Recursive Trellis Decoding Techniques of Polar Codes |

1610 | Refined Strong Converse for the Constant Composition Codes |

1769 | Registration of Finite Resolution Images: a Second-order Analysis |

1248 | Reinforcement Learning with Neural Networks for Quantum Multiple Hypothesis Testing |

1881 | Reliable Distributed Clustering with Redundant Data Assignment |

1257 | Remote Joint Strong Coordination and Reliable Communication |

1674 | Rényi Bounds on Information Combining |

1245 | Rényi Divergence rates of Ergodic Markov Chains: existence, explicit expressions and properties |

1830 | Rényi Entropy Bounds on the Active Learning Cost-Performance Tradeoff |

1390 | Repair of RS codes with optimal access and error correction |

1043 | Resolution Limits of Non-Adaptive Querying for Noisy 20 Questions Estimation |

1627 | Resolvability of the Multiple Access Channel with Two-Sided Cooperation |

1919 | Resource Allocation in Low Density Spreading Uplink NOMA via Asymptotic Analysis |

1587 | Revisiting Zero-Rate Bounds on the Reliability Function of Discrete Memoryless Channels |

1900 | Robust Gaussian Joint Source-Channel Coding Under the Near-Zero Bandwidth Regime |

1630 | Robust Generalization via f-Mutual Information |

1607 | Robust Indexing - Optimal Codes for DNA Storage |

1044 | Scalable source coding with causal side information and a causal helper |

1917 | Second-Order Achievable Rates for a Block Fading Gaussian Multiple Access Channel |

1695 | Second-Order Asymptotically Optimal Change-point Detection Algorithm with Sampling Control |

1344 | Second-order asymptotics of quantum data compression from partially-smoothed conditional entropy |

1548 | Second-Order Asymptotics of Sequential Hypothesis Testing |

1065 | Secret Key Generation From Vector Gaussian Sources With Public and Private Communications |

1588 | Secret sharing schemes based on nonlinear codes |

1412 | Secure Communications with Limited Common Randomness at Transmitters |

1504 | Secure Computation to Hide Functions of Inputs |

1394 | Secure Decentralized Pliable Index Coding |

1994 | Secure Determinant Codes: Type-II Security |

1666 | Secure GDoF of the Z-channel with Finite Precision CSIT: How Robust are Structured Codes? |

1381 | Secure Information Exchange for Omniscience |

1945 | Secure Network and Index Coding Equivalence: The Last Piece of the Puzzle |

1355 | Secure Node Repair of Reed-Solomon Codes |

1019 | Semantic Security for Quantum Wiretap Channels |

1262 | Sequence Obfuscation to Thwart Pattern Matching Attacks |

1979 | Sequential anomaly detection with observation control under a generalized error metric |

1622 | Sequential detection and isolation of a correlated pair |

1317 | Sequential Hypothesis Criterion Based Optimal Caching Schemes in Wireless Networks |

1285 | Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency |

1845 | Single-Deletion Single-Substitution Correcting Codes |

1679 | Single-Server Multi-message Private Information Retrieval with Side Information: the General Cases |

1047 | Social Learning with Beliefs in a Parallel Network |

1687 | Some Performance Guarantees of Global LASSO with Local Assumptions for Convolutional Sparse Design Matrices |

1350 | Some results on convolution idempotents |

1524 | Some Results on the Vector Gaussian Hypothesis Testing Problem |

1977 | Sparse Activity Detection in Cell-Free Massive MIMO systems |

1665 | Spatially Coupled Codes with Sub-Block Locality: Joint Finite Length-Asymptotic Design Approach |

1747 | Stabilizing Dynamical Systems with Fixed-Rate Feedback using Constrained Quantizers |

1840 | Staggered Diagonal Embedding Based Linear Field Size Streaming Codes |

1277 | Stealth Communication with Vanishing Power over Binary Symmetric Channels |

1764 | Stochastic Bottleneck: Rateless Auto-Encoder for Flexible Dimensionality Reduction |

1866 | Straggler-free Coding for Concurrent Matrix Multiplications |

1600 | Streaming Erasure Codes over Multi-hop Relay Network |

1720 | Strong Asymptotic Composition Theorems for Sibson Mutual Information |

1860 | Strong Converse Bounds in Quantum Network Information Theory |

1469 | Strong Converse for the State Dependent Channel |

1323 | Strong Coordination with Side Information |

1670 | Strongly Explicit and Efficiently Decodable Probabilistic Group Testing |

1836 | Structural Properties of Nonanticipatory Epsilon Entropy of Multivariate Gaussian Sources |

1709 | Structure of Optimal Quantizer for Binary-Input Continuous-Output Channels with Output Constraints |

1290 | Structured Quasi-Gray labelling for Reed-Muller Grassmannian Constellations |

1871 | Successive Cancellation Inactivation Decoding for Modified Reed-Muller and eBCH Codes |

1805 | Successive Refinement to Caching for Dynamic Requests |

1750 | Support Constrained Generator Matrices of Gabidulin Codes in Characteristic Zero |

1966 | Symbolwise MAP Estimation for Multiple-Trace Insertion/Deletion/Substitution Channels |

1493 | Symmetrizability for Myopic AVCs |

1623 | Syndrome Compression for Optimal Redundancy Codes |

1159 | Tangential-Sphere Bound Revisited |

1489 | Temporal Ordered Clustering in Dynamic Networks |

1905 | Testing for Anomalies: Active Strategies and Non-asymptotic Analysis |

1955 | Tetrahedral Coding and Non-Unitary Resilience in Polarization-Multiplexed Lightwave Transmissions |

1034 | The Arbitrarily Varying Channel with Colored Gaussian Noise |

1093 | The Asymptotic Generalized Poor-Verdú Bound Achieves the BSC Error Exponent at Zero Rate |

1340 | The Capacity of Multidimensional Permutations with Restricted Movement |

1445 | The Capacity of Private Information Retrieval Under Arbitrary Collusion Patterns |

1534 | The Capacity of Single-Server Weakly-Private Information Retrieval |

1555 | The Communication-Aware Clustered Federated Learning Problem |

1770 | The Courtade-Kumar Most Informative Boolean Function Conjecture and a Symmetrized Li-Médard Conjecture are Equivalent |

1705 | The Error Probability of Maximum-Likelihood Decoding over Two Deletion Channels |

1283 | The Fading Gaussian Broadcast Channel with Channel State Information and Output Feedback |

1164 | The Langberg-Medard Multiple Unicast Conjecture: Stable 3-Pair Networks |

1284 | The Minimum Upload Cost of Symmetric Private Information Retrieval |

1117 | The Numbers of De Bruijn Sequences in Extremal Weight Classes |

1292 | The Power of Graph Convolutional Networks to Distinguish Random Graph Models |

1247 | Thermodynamically Stable DNA Code Design using a Similarity Significance Model |

1335 | Time-Frequency Division Multiple Access and the TFDMA Ad Hoc Network Based on the (n, n(n-1), n-1) Permutation Group Codes |

1717 | Timely Estimation Using Coded Quantized Samples |

1111 | Timely Status Updating Through Intermittent Sensing and Transmission |

1699 | Topology-Aware Cooperative Data Protection in Blockchain-Based Decentralized Storage Networks |

1179 | Toward Optimality in Both Repair and Update via Generic MDS Code Transformation |

1633 | Tracking an Auto-Regressive Process with Limited Communication |

1180 | Treating Interference as Noise is Optimal for Covert Communication over Interference Channels |

1669 | Trimming Decoding of Color Codes over the Quantum Erasure Channel |

1613 | Twisted-Pair Superposition Transmission for Low Latency Communications |

1779 | Two-Sample Testing on Pairwise Comparison Data and the Role of Modeling Assumptions |

1380 | Uncertainty of Reconstructing Multiple Messages from Uniform-Tandem-Duplication Noise |

1856 | Universal Communication Efficient Quantum Threshold Secret Sharing Schemes |

1142 | Universal superposition codes: capacity regions of compound quantum broadcast channel with confidential messages |

1620 | Unsourced Multiuser Sparse Regression Codes achieve the Symmetric MAC Capacity |

1706 | Update Aware Device Scheduling for Federated Learning at the Wireless Edge |

1167 | Uplink Cost Adjustable Schemes in Secure Distributed Matrix Multiplication |

1457 | Upper Bound Scalability on Achievable Rates of Batched Codes for Line Networks |

1685 | Usable deviation bounds for the information content of convex measures |

1105 | Variable-Length Source Dispersions Differ under Maximum and Average Error Criteria |

1691 | Weakly Private Information Retrieval under the Maximal Leakage Metric |

1022 | Weak-Noise Modulation-Estimation of Vector Parameters |

1596 | Weight Distributions of q-ary Optimal Locally Repairable Codes with Locality 2, Distance 5 and Even Dimension |

1327 | Weight Enumerators for Number-Theoretic Codes and Cardinalities of Non-binary VT Codes |

1190 | What is the Value of Data? on Mathematical Methods for Data Quality Estimation |

1575 | When does Partial Noisy Feedback Enlarge the Capacity of a Gaussian Broadcast Channel? |

1460 | When does the Tukey Median work? |

1768 | Wireless Federated Learning with Local Differential Privacy |

1328 | Zero-Error Coding with a Generator Set of Variable-Length Words |

Plan Ahead

2021 IEEE International Symposium on Information Theory

**11-16 July 2021 ** | **Melbourne, Victoria, Australia**