Following is the list of accepted ISIT 2024 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 isit2024@cmsworkshops.com.
| Paper Number | Paper Title |
|---|---|
| 2019 | $L_q$ Lower Bounds on Distributed Estimation via Fisher Information |
| 1997 | A (Weakly) Polynomial Algorithm for AIVF Coding |
| 1086 | A Binary Linear Functional-repair Regenerating Code on 72 Coding Spaces Related to PG(2,8) |
| 1369 | A Capacity Result on Weakly-Private Information Retrieval |
| 1387 | A Causal Model for Quantifying Multipartite Classical and Quantum Correlations |
| 1181 | A Combinatorial Perspective on Random Access Efficiency for DNA Storage |
| 1412 | A Convergence Analysis of Approximate Message Passing with Non-Separable Functions and Applications to Multi-Class Classification |
| 1731 | A Converse Bound on the Mismatched Distortion-Rate Function |
| 1788 | A Convolutional Variant of the Niederreiter Cryptosystem with GRS Codes |
| 1339 | A Cross Entropy Interpretation of Rényi Entropy for $α$-leakage |
| 2136 | A Distributionally Robust Approach to Shannon Limits using the Wasserstein Distance |
| 1198 | A Double Maximization Approach for Optimizing the LM Rate of Mismatched Decoding |
| 1701 | A Family of Access-Friendly MDS Array Codes |
| 1548 | A family of permutationally invariant quantum codes |
| 1230 | A Formula for the I/O Cost of Linear Repair Schemes and Application to Reed-Solomon Codes |
| 1066 | A Joint Code and Belief Propagation Decoder Design for Quantum LDPC Codes |
| 1609 | A Key-recovery Attack on the LCMQ Authentication Protocol |
| 1078 | A Linear Feedback Coding Scheme for Computation Over Gaussian Multiple-Access Channels |
| 1682 | A Mathematical Framework for Computability Aspects of Algorithmic Transparency |
| 1982 | A Monotone Circuit Construction for Individually-Secure Multi-Secret Sharing |
| 1621 | A multi-sequence Prophet Inequality under observation constraints |
| 1595 | A Multi-Server Publicly Verifiable Computation Scheme with Context-Hiding Property |
| 1728 | A New Approach to Harnessing Side Information in Multi-Server Private Information Retrieval |
| 1665 | A New Characterization Of Augustin Information And Mean |
| 1532 | A New Construction of Enhanced Cross Z-Complementary Sets With Maximum Zero Correlation Zone |
| 1493 | A New Construction of Optimal Symmetrical ZCCS |
| 1732 | A new family of binary sequences based on the generalized ERC construction |
| 1649 | A New Multi-receiver Authentication Scheme For General Access Structure |
| 1384 | A note on generalization bounds for losses with finite moments |
| 1710 | A Novel Cross Domain Iterative Detection based on the Interplay between SPA and LMMSE |
| 1547 | A Path Metric Based Construction of Polarization-Adjusted Convolutional Codes |
| 1683 | A Perfect Ideal Hierarchical Secret Sharing Scheme Based on The CRT for Polynomial Rings |
| 2139 | A Poisson Decomposition for Information and the Information-Event Diagram |
| 1396 | A probabilistic analysis on general probabilistic scheduling problems |
| 1324 | A Quantitative Version of More Capable Channel Comparison |
| 1935 | A Random CSP with Connections to Discrepancy Theory and Randomized Trials |
| 1101 | A Relay Algorithm of BCH Codes for a Quick Start of the Berlekamp-Massey Algorithm |
| 1145 | A Simple Self-Decoding Model for Neural Coding |
| 1260 | A Study of APN Functions in Dimension 7 using Antiderivatives |
| 1157 | A Third Information-Theoretic Approach to Finite de Finetti Theorems |
| 1538 | A Unified Study on Sequentiality in Universal Classification with Empirically Observed Statistics |
| 2075 | A Unified View of Group Fairness Tradeoffs Using Partial Information Decomposition |
| 1893 | Abelian Group Codes for Classical and CQ Channel Coding: One-shot and Asymptotic Rate Bounds |
| 1561 | Accelerating Quadratic Transform and WMMSE |
| 1405 | Achievable Rate for RIS-Assisted Sparse Channel with State Training |
| 1753 | Achieving Capacity of PIR with Private Side Information with Low Sub-packetization and without MDS Codes |
| 1501 | Achieving DNA Labeling Capacity with Minimum Labels through Extremal de Bruijn Subgraphs |
| 1035 | Achieving Gaussian Vector Broadcast Channel Capacity with Scalar Lattices |
| 1233 | Achieving the Exactly Optimal Privacy-Utility Trade-Off with Low Communication Cost via Shared Randomness |
| 1775 | Adversarial Quantum Machine Learning: An Information-Theoretic Generalization Analysis |
| 1698 | Age Aware Scheduling for Differentially-Private Federated Learning |
| 1159 | Age of Gossip in Random and Bipartite Networks |
| 1356 | AIFV Codes Allowing 2-bit Decoding Delays for Unequal Bit Cost |
| 1791 | Algebraic Geometry Codes for Cross-Subspace Alignment in Private Information Retrieval |
| 1752 | Algorithms for Computing the Free Distance of Convolutional Codes |
| 1926 | Amplitude Transformation of Quantum State Based on QSVT |
| 2096 | An Achievable and Analytic Solution to Information Bottleneck for Gaussian Mixtures |
| 1715 | An Achievable Error Exponent for the Information Bottleneck Channel |
| 1166 | An Achievable Scheme for Channels with an Amplitude Constraint Using Walsh Functions |
| 1063 | An Answer to an Open Problem on Balanced Boolean Functions with the Maximum Possible Walsh Supports |
| 1358 | An Asymmetric Encoding-Decoding Scheme for Lossless Data Compression |
| 1228 | An Earlier Termination Algorithm to Find Error Locator Polynomial in Error Correction of RS Codes |
| 1586 | An Efficient Inversion Encoding Scheme with $k$ INV Signals on Bus Transmission |
| 1592 | An Efficient, High-Rate Scheme for Private Information Retrieval over the Gaussian MAC |
| 2127 | An Encoder-Decoder Approach for Packing Circles |
| 1293 | An entropic inequality in finite Abelian groups analogous to the unified Brascamp-Lieb and Entropy Power Inequality |
| 2165 | An Expectation-Maximization Relaxed Method for Privacy Funnel |
| 2154 | An Explicit Construction of $q$-ary MDS Array Codes and Their Efficient Decoding |
| 2080 | An extension of Mcdiarmid's inequality |
| 1232 | An Improved Lower Bound on Oblivious Transfer Capacity via Interactive Erasure Emulation |
| 1413 | An Improved Upper Bound for Distributed Hypothesis Testing |
| 1733 | An Improved Viterbi Algorithm for a Class of Optimal Binary Convolutional Codes |
| 1343 | An Information-Theoretic Approach to Anonymous Access Control |
| 1992 | An Information-Theoretic Framework for Out-of-Distribution Generalization |
| 1506 | An information-theoretic proof of the Shannon-Hagelbarger theorem |
| 2047 | An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes |
| 1349 | An Unconditionally Secure Encryption Protocol for Cloud Storage |
| 1519 | Analysis of Coded Shaped QAM Signaling at Short and Moderate Lengths |
| 1528 | Anomaly Search of a Hidden Markov Model |
| 1570 | AoII-Optimum Sampling of CTMC Information Sources Under Sampling Rate Constraints |
| 1762 | AoI-optimal Scheduling for Arbitrary K-channel Update-Through-Queue Systems |
| 1555 | Approaching Maximum Likelihood Decoding Performance via Reshuffling ORBGRAND |
| 1837 | Approximate Locally Decodable Codes with Constant Query Complexity and Nearly Optimal Rate |
| 1742 | Asymptotic Capacity of Non-Coherent One-Bit MIMO Channels with Block Fading |
| 1671 | Asymptotic construction of locally repairable codes with multiple recovering sets |
| 1767 | Asymptotic Estimates for Spectral Estimators of Rotationally Invariant Matrices |
| 1960 | Asymptotically Optimal Codes Correcting One Substring Edit |
| 2056 | Asymptotically optimal multistage tests for multihypothesis testing |
| 1818 | Asymptotics of Language Model Alignment |
| 1867 | BAI in Exponential Family: Efficiency and Optimality |
| 1727 | Batch Universal Prediction |
| 2044 | Bayesian Persuasion: From Persuasion toward Counter-suasion |
| 1886 | Beamforming Design for Integrated Sensing and Communications Using Uplink-Downlink Duality |
| 1422 | Belief Propagation Decoding of Quantum LDPC Codes with Guided Decimation |
| 1938 | Benefits of Stochastic Mirror Descent in High-Dimensional Binary Classification |
| 1750 | Best Arm Identification with Arm Erasures |
| 1976 | Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes |
| 1681 | Binary Maximal Leakage |
| 1325 | Binomial Channel: On the Capacity-Achieving Distribution and Bounds on the Capacity |
| 1841 | Bipartite entanglement of noisy stabilizer states through the lens of stabilizer codes |
| 1608 | Bistatic Integrated Sensing and Communication over Memoryless Relay Channels |
| 2205 | Bit-flipping Decoder Failure Rate Estimation for (v,w)-regular Codes |
| 1368 | Blahut-Arimoto Algorithm for Computing Capacity Region of Gaussian Vector Broadcast Channels |
| 1969 | Boundary Multiple Measurement Vectors for Multi-Coset Sampler |
| 1651 | Bounding Weakly Correlated Products from Below: Supermodularity is All You Need |
| 1604 | Bounds on the Statistical Leakage-Resilience of Shamir's Secret Sharing |
| 1486 | Break-Resilient Codes for Forensic 3D Fingerprinting |
| 1588 | Broadcast Channel Synthesis from Shared Randomness |
| 1426 | Byzantine-Resilient Federated Principal Subspace Estimation |
| 1865 | Camouflage Adversarial Attacks on Multiple Agent Systems |
| 1268 | Capacity of Frequency-based Channels: Encoding Information in Molecular Concentrations |
| 1202 | Capacity of Runlength-Limited and GC-Content Constrained Codes for DNA Data Storage |
| 2155 | Capacity-Maximizing Input Symbol Selection for Discrete Memoryless Channels |
| 2114 | Causal Impact Analysis for Asynchronous Decision Making |
| 1217 | Causality Testing, Directed Information and Spike Trains |
| 1965 | Channel Coding with Mean and Variance Cost Constraints |
| 1051 | Characterization of the Distortion-Perception Tradeoff for Finite Channels with Arbitrary Metrics |
| 1160 | Characterizing positive-rate secure multicast network coding with eavesdropping nodes |
| 1359 | Code Design for Duplex Read Sequencing |
| 1653 | Code Rate Optimization via Neural Polar Decoders |
| 1636 | Code-Based Single-Server Private Information Retrieval: Circumventing the Sub-Query Attack |
| 1038 | Coded Caching for Hierarchical Two-Layer Networks with Coded Placement |
| 1669 | Coded Caching with File and Demand Privacy |
| 1967 | Coded Computing Meets Quantum Circuit Simulation: Coded Parallel Tensor Network Contraction Algorithm |
| 1573 | Coded Kalman Filtering over MIMO Gaussian Channels with Feedback |
| 1418 | Coded Many-User Multiple Access via Approximate Message Passing |
| 1479 | Coded Multi-User Information Retrieval with a Multi-Antenna Helper Node |
| 1205 | Codes Over Absorption Channels with Memory Two |
| 1832 | Coding for Composite DNA to Correct Substitutions, Strand Losses, and Deletions |
| 2204 | Coding Scheme for Noisy Nanopore Sequencing with Backtracking and Skipping Errors |
| 1242 | Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information |
| 1515 | Coherent Distributed Source Simulation as Multipartite Quantum State Splitting |
| 1273 | Common Function Reconstruction with Information Swapping Terminals |
| 1323 | Common Randomness Generation from Finite Compound Sources |
| 1527 | Competitive Analysis of Arbitrary Varying Channels |
| 2052 | Complementary Exclusion of Full Polynomials to Enable Dual List Decoding of Convolutional Codes |
| 1499 | Computation in Server-Assisted Noisy Networks |
| 1334 | Computation of the Multivariate Gaussian Rate-Distortion-Perception Function |
| 1995 | Computation Selection: Scheduling Users to Enable Over-the-Air Federated Learning |
| 1706 | Computationally Efficient Codes for Strongly Dobrushin-Stambler Nonsymmetrizable Oblivious AVCs |
| 1133 | Compute-Forward Multiple Access for Gaussian Fast Fading Channels |
| 1226 | Computing Augustin Information via Hybrid Geodesically Convex Optimization |
| 1428 | Computing Capacity of Binary Arithmetic Sum over Asymmetric Diamond Network |
| 1541 | Conditional Mutual Information Constrained Deep Learning: Framework and Preliminary Results |
| 1713 | Constructing $(h,k+1)$ cooperative MSR codes with sub-packetization $(h+1)2^{\lceil n/2 \rceil}$ |
| 1437 | Construction of 4-phase Golay Complementary Sequence Sets with Small Number of Constituent Sequences and Arbitrary Length |
| 2122 | Construction of Binary Odd Shift Complementary Pairs of All Lengths |
| 1365 | Construction of Locally Repairable Array Codes with Optimal Repair Bandwidth under the Rack-Aware Storage Model |
| 1497 | Construction πA lattices extended to Hurwitz quaternion integers |
| 1263 | Constructions of Binary MDS Array Codes with Optimal Cooperative Repair Bandwidth |
| 1672 | Controlled privacy leakage propagation throughout differential private overlapping grouped learning |
| 1624 | Coordination Coding with Causal Encoder for Vector-valued Witsenhausen Counterexample |
| 2116 | Copula-based Estimation of Continuous Sources for a Class of Constrained Rate-Distortion-Functions |
| 1176 | Correcting a Single Deletion in Reads from a Nanopore Sequencer |
| 2057 | Coset Error Patterns in Recursive Projection-Aggregation Decoding |
| 1721 | Covering All Bases: The Next Inning in DNA Sequencing Efficiency |
| 2162 | Covert Distributed Detection over Discrete Memoryless Channels |
| 1142 | Cross-Validation Conformal Risk Control |
| 1058 | CRYSTALS-Kyber With Lattice Quantizer |
| 1664 | Data Transmission over a Bosonic Channel under Classical Noise |
| 2090 | Data-Dependent Generalization Bounds via Variable-size Compressibility |
| 1408 | Data-Driven Estimation of the False Positive Rate of the Bayes Binary Classifier via Soft Labels |
| 1858 | Decentralized Expectation Propagation for Semi-Blind Channel Estimation in Cell-Free Networks |
| 2198 | Decentralized Uncoded Storage Elastic Computing with Heterogeneous Computation Speeds |
| 1803 | Decoding Analog Subspace Codes: Algorithms for Character-Polynomial Codes |
| 1135 | Decoding Sparse Reed-Solomon Codes with Known Support |
| 1440 | Decoding Strategies for Generalized Quantum Data-Syndrome Coding Problems |
| 1697 | Deep Holes of Twisted Reed-Solomon Codes |
| 2166 | Dense KO Codes: Faster Convergence and Reduced Complexity through Dense Connectivity |
| 1139 | Design and analysis of a family of complexity-constrained LDPC codes |
| 1294 | Detection of Correlated Random Vectors |
| 2148 | Detection of False Data Injection Attacks in Cyber-Physical Systems |
| 2045 | Detection of Signals in Colored Noise: Leading Eigenvalue Test for Non-central F-matrices |
| 1883 | Deterministic identification over channels with finite output: a dimensional perspective on superlinear rates |
| 1804 | Deterministic Identification: From Theoretical Analysis to Practical Identification Codes |
| 2033 | Differentially Private Fair Binary Classifications |
| 2072 | Differentially Private Synthetic Data with Private Density Estimation |
| 2186 | Differential-Privacy Capacity |
| 1402 | Dimensional discrete entropy power inequalities for log-concave random vectors |
| 1091 | Directed Redundancy in Time Series |
| 1581 | DIST-CURE: A Robust Distributed Learning Algorithm with Cubic Regularized Newton |
| 1072 | Distributed Learning for Dynamic Congestion Games |
| 1552 | Distributed Local Sketching for $\ell_2$ Embeddings |
| 1629 | Distributed matrix multiplication with straggler tolerance using algebraic function fields |
| 2105 | Distributed Sampling for the Detection of Poisson Sources under Observation Erasures |
| 1234 | Distributed Source Coding Using Constrained-Random-Number Generators |
| 1833 | Distributed Structured Matrix Multiplication |
| 2164 | Distributionally Robust Degree Optimization for BATS Codes |
| 1951 | Distribution-Preserving Integrated Sensing and Communication with Secure Reconstruction |
| 1489 | DoF Analysis for (M, N)-Channels through a Number-Filling Puzzle |
| 1835 | Dual-Source Symmetric PIR without Data Replication or Shared Randomness |
| 2099 | E_gamma-Mixing Time |
| 1633 | Effect of Weight Quantization on Learning Models by Typical Case Analysis |
| 1909 | Efficient and Timely Memory Access |
| 2082 | Efficient Binary Batched Network Coding employing Partial Recovery |
| 1282 | Efficient Constructions of Non-binary Codes over Absorption Channels |
| 1585 | Efficient Decoding of a Class of Reed-Solomon Codes over Fermat Fields |
| 1113 | Efficient designs for threshold group testing without gap |
| 1352 | Efficient DNA Synthesis Codes with Error Correction and Runlength Limited Constraint |
| 2200 | Efficient Nonconvex Optimization for Two-way Sparse Reduced-Rank Regression |
| 2025 | Efficient Root-Finding for Interpolation-Based Decoding of Elliptic and Hyperelliptic Codes |
| 1514 | Efficient Unbiased Sparsification |
| 1080 | Electromagnetic Information Theory Motivated Near-Field Channel Model |
| 1540 | Empirical Risk Minimization and Uniform Convergence for Probabilistically Observed and Quantum Measurement Hypothesis Classes |
| 1240 | Endomorphisms of Linear Block Codes |
| 1989 | Enhanced ODMA with Channel Code Design and Pattern Collision Resolution for Unsourced Multiple Access |
| 1729 | Enhancing the Maximum Tolerable Number of Active Users for Unsourced Random Access |
| 1425 | Entanglement cost of discriminating quantum states under locality constraints |
| 1981 | Entanglement sharing across a damping-dephasing channel |
| 1435 | Entanglement-Assisted Quantum Codes from a Class of Unitary Matrices |
| 1583 | Entropy-Achieving Compression with Private Local Decodability |
| 1463 | Equal Requests are Asymptotically Hardest for Data Recovery |
| 1808 | Equivalence of the Empirical Risk Minimization to Regularization on the Family of f-Divergences |
| 1830 | Erasure Coded Neural Network Inference via Fisher Averaging |
| 1184 | Error Correction Capabilities of Non-Linear Cryptographic Hash Functions |
| 1939 | Error correction from partial information via norm-trace codes |
| 1411 | Error Exponent in Agnostic PAC Learning |
| 1464 | Error Exponents of Discrete Memoryless Channels Under Small Mismatch |
| 1391 | Error-Correcting Codes for Combinatorial Composite DNA |
| 1885 | Error-Resilient Weakly Constrained Coding via Row-by-Row Coding |
| 1366 | Estimating the Weight Enumerators of Reed-Muller Codes via Sampling |
| 1794 | Estimation of Rate-Distortion Function for Computing with Decoder Side Information |
| 1081 | Exact Error Exponents for a Concatenated Coding Based Class of DNA Storage Codes |
| 1163 | Exact Graph Matching in Correlated Gaussian-Attributed Erdos-Renyi Model |
| 1057 | Existential Unforgeability in Quantum Authentication From Quantum Physical Unclonable Functions Based on Random von Neumann Measurement |
| 1726 | Explicit Formula for Partial Information Decomposition |
| 1984 | Explicit Good Codes Approaching Distance 1 in Ulam Metric |
| 1648 | Explicit Subcodes of Reed–Solomon Codes that Efficiently Achieve List Decoding Capacity |
| 1533 | Exploiting signature leakages: breaking Enhanced pqsigRM |
| 1765 | Explore-then-Commit Algorithms for Decentralized Two-sided Matching Markets |
| 1420 | Fast FixMatch: Faster Semi-Supervised Learning with Curriculum Batch Size |
| 1297 | Fast Readable Multi-Cell Coding for Flash Memory |
| 1827 | Federated Learning for Heterogeneous Bandits with Unobserved Contexts |
| 1015 | Federated Learning via Lattice Joint Source-Channel Coding |
| 1990 | Fed-IT: Addressing Class Imbalance in Federated Learning through an Information-Theoretic Lens |
| 2092 | Feedback Capacity of Nonlinear Decision Models with General Noise: Gaussian Applications with Filtering and Control Riccati Equations |
| 1959 | Few-Shot Channel-Agnostic Analog Coding: A Near-Optimal Scheme |
| 1768 | Feynman Meets Turing: The Uncomputability of Quantum Gate-Circuit Emulation and Concatenation |
| 1641 | Finite-Length Analysis of Polar Secrecy Codes for Wiretap Channels |
| 1864 | Fixed-Memory Capacity Bounds for the Gilbert-Elliott Channel |
| 1401 | Flexible Field Sizes in Secure Distributed Matrix Multiplication via Efficient Interference Cancellation |
| 1513 | Frame Codes for the Block-Erasure Channel |
| 1877 | Frequency Domain Diffusion Model with Scale-Dependent Noise Schedule |
| 1340 | Fully quantum arbitrarily varying channel coding for entanglement-assisted communication |
| 1680 | Fundamental Limits of Communication-Assisted Sensing in ISAC Systems |
| 1337 | Fusion over the Grassmannian for High-Rank Matrix Completion |
| 1999 | Game of Coding: Beyond Trusted Majorities |
| 2150 | Gaussian Channel Simulation with Rotated Dithered Quantization |
| 1182 | Gaussian mixtures: convexity properties and CLT rates for the entropy and Fisher information |
| 1141 | Generalization and Informativeness of Conformal Prediction |
| 2171 | Generalization of LiNGAM that allows confounding |
| 1724 | Generalized concatenated polarization kernels |
| 1275 | Generalized Gradient Flow Decoding and Its Tensor-Computability |
| 2111 | Generalized Quasi-Cyclic LDPC Codes: Design and Efficient Encoding |
| 2178 | Generalized Reed-Muller codes: A new construction of information sets |
| 1438 | Generalized Step-Chirp Sequences With Flexible Bandwidth |
| 2144 | Goal-Oriented Communications for Remote Inference under Two-Way Delay with Memory |
| 1613 | GRAND-Assisted Random Linear Network Coding in Wireless Broadcasts |
| 1642 | Graph Neural Network-based Joint Equalization and Decoding |
| 1491 | Graph Neural Networks for Enhanced Decoding of Quantum LDPC Codes |
| 1947 | Graph Reconstruction from Noisy Random Subgraphs |
| 1880 | GRLinQ: A Distributed Link Scheduling Mechanism with Graph Reinforcement Learning |
| 1461 | Group Codes with Low-Density Orthogonal Idempotent |
| 1910 | Group Complete-{s} Pliable Index Coding |
| 1844 | Group Fairness with Uncertain Sensitive Attributes |
| 1930 | Group Testing with General Correlation Using Hypergraphs |
| 1769 | Group-Sparse Subspace Clustering with Elastic Stars |
| 1568 | Guaranteed Robust Large Precision Matrix Estimation Under t-distribution |
| 1118 | HetDAPAC: Distributed Attribute-Based Private Access Control with Heterogeneous Attributes |
| 2201 | Hierarchical Federated Learning: The Interplay of User Mobility and Data Heterogeneity |
| 1968 | Hierarchical Generalization Bounds for Deep Neural Networks |
| 1868 | High Probability Latency Quickest Change Detection over a Finite Horizon |
| 1498 | Implicit and Explicit Formulas of the Joint RDF for a Tuple of Multivariate Gaussian Sources with Individual Square-Error Distortions |
| 1800 | Improved Bound for Robust Causal Bandits with Linear Models |
| 1445 | Improved bounds on the interactive capacity via error pattern analysis |
| 1075 | Improved Bounds on the Number of Support Points of the Capacity-Achieving Input for Amplitude Constrained Poisson Channels |
| 1264 | Improved Coded Caching from Two New Classes of PDAs from t-Designs |
| 1364 | Improved Construction of Robust Gray Codes |
| 1039 | Improved Hotplug Caching Scheme Using PDAs |
| 1488 | Improved Logical Error Rate via List Decoding of Quantum Polar Codes |
| 1018 | Improved Non-Asymptotic Lower Bound on the Size of Optimal Insertion/Deletion Correcting Code |
| 1747 | Improved Upper Bound for the Size of a Trifferent Code |
| 2048 | Improving the Singleton-type Upper Bounds for Non-Linear Deletion Correcting Codes |
| 2183 | Infodemic Source Detection: Enhanced Formulations with Information Flow |
| 1834 | InfoMat: A Tool for the Analysis and Visualization Sequential Information Transfer |
| 1443 | Information Exchange is Harder with Noise at Source |
| 1082 | Information Rates Over DMCs With Many Independent Views |
| 1888 | Information Theoretic Analysis of a Quantum PUF |
| 1206 | Information Velocity of Cascaded AWGN Channels with Feedback |
| 1512 | Information-Energy Capacity Region for SLIPT Systems over Lognormal-Fading Channels |
| 2194 | Integrated Sensing and Communication Exploiting Prior Information: How Many Sensing Beams are Needed? |
| 1510 | Integrated Sensing and Communication in the Finite Blocklength Regime |
| 1898 | Interactive Byzantine-Resilient Gradient Coding for General Data Assignments |
| 1261 | Inter-Modal Coding in Broadcast Packet Erasure Channels with Varying Statistics |
| 1725 | Interpreting Deepcode, a learned feedback code |
| 1564 | Intrinsic Fairness-Accuracy Tradeoffs under Equalized Odds |
| 1554 | Isolate and then Identify: Rethinking Adaptive Group Testing |
| 2172 | Joint Sequential Detection and Isolation of Anomalies under Composite Hypotheses |
| 1284 | Large Deviations for Statistical Sequence Matching |
| 1688 | Less than 1-Bit Control of an Unstable AR Process with 1--Bit Quantizers |
| 1124 | Limit Distribution for Quantum Relative Entropy |
| 1905 | Linear Operator Approximate Message Passing: Power Method with Partial and Stochastic Updates |
| 1977 | Linearity-Enhanced Serial List Decoding of Linearly Expurgated Tail-Biting Convolutional Codes |
| 2193 | List-Decoding Separable Matrices for Non-Adaptive Combinatorial Group Testing |
| 1542 | Local Decoding in Distributed Approximate Computing |
| 1760 | Locally-Measured Rényi Divergences |
| 2000 | Log-Concave Coupling for Sampling Neural Net Posteriors |
| 1154 | Low Complexity Approximate Bayesian Logistic Regression for Sparse Online Learning |
| 1720 | Low-Complexity Constrained Coding Schemes for Two-Dimensional Magnetic Recording |
| 2176 | Low-Complexity Pearson-Based Detection for AWGN Channels with Offset |
| 1296 | Lower Bounds on Mutual Information for Linear Codes Transmitted over Binary Input Channels, and for Information Combining |
| 1929 | Low-rank Matrix Sensing With Dithered One-Bit Quantization |
| 1942 | Low-Rate, Low-Distortion Compression with Wasserstein Distortion |
| 1465 | Many-user multiple access with random user activity |
| 1773 | Maximal Guesswork Leakage |
| 1257 | Maximal α-Leakage for Quantum Privacy Mechanisms and Operational Meaning of Measured Rényi Capacity |
| 1019 | McKean’s Conjecture Under the Log-Concavity Assumption |
| 1185 | Message-Cognizant Assistance and Feedback for the Gaussian Channel |
| 1900 | Message-Relevant Dimension Reduction of Neural Populations |
| 1196 | Min-Entropic Quantities Induced by Cones: Properties & Operational Interpretations |
| 2160 | Minimal Communication-Cost Statistical Learning |
| 1085 | Minimax Regret with Unbounded Weights |
| 2195 | Minimizing Distortion in Data Embedding Using LDGM Codes and the Cavity Method |
| 1560 | Mining Invariance from Nonlinear Multi-Environment Data: Binary Classification |
| 2073 | Missing Mass under Random Duplications |
| 1442 | Mixed-Weight Conflict-Avoiding Codes |
| 1138 | Modulo Sampling with 1-bit Side Information: Performance Guarantees in the Presence of Quantization |
| 1041 | Monitoring High-dimensional Streaming Data via Fusing Nonparametric Shiryaev-Roberts Statistics |
| 1819 | More results for regenerating codes on graphs |
| 1017 | MSR Codes with Linear Field Size and Smallest Sub-packetization for Any Number of Helper Nodes |
| 1419 | Multi-access Distributed Computing Models using Map-Reduce Arrays |
| 1505 | Multi-armed Bandits with Probing |
| 1617 | Multiplicity assignments for Koetter-Vardy decoding. The case of traceability codes. |
| 1813 | Multi-Task Private Semantic Communication |
| 1089 | Multi-terminal Strong Coordination over Noisy Channels with Secrecy Constraints |
| 1973 | Multi-User SR-LDPC Codes via Coded Demixing with Applications to Cell-Free Systems |
| 1495 | Multivariate Priors and the Linearity of Optimal Bayesian Estimators under Gaussian Noise |
| 2202 | Mutual Information of a class of Poisson-type Channels using Markov Renewal Theory |
| 1758 | Near optimal constructions of frameproof codes |
| 1612 | Nearest Neighbor Decoding for a Class of Compound Channels |
| 2020 | Nearest Neighbor Representations of Neural Circuits |
| 1214 | Near-optimal constructions of constant weight codes and constant composition codes asymptotically attaining the Johnson bound |
| 2022 | Near-Optimal Generalized Decoding of Polar-like Codes |
| 1678 | Nested Construction of $\mathbb{Z}_{2^L}$-Linear Codes |
| 2046 | Nested Construction of Polar Codes via Transformers |
| 1306 | Network Analysis of Baker's Map Implemented in a Fixed-point Arithmetic Domain |
| 1312 | Network Coding-Based Post-Quantum Cryptography for Multi-Users with Different Security Permissions |
| 1825 | Networked Control with Hybrid Automatic Repeat Request Protocols |
| 1776 | Neural Estimation of Entropic Optimal Transport |
| 1676 | Neural Estimation of Multi-User Capacity Regions over Discrete Channels |
| 1504 | Neural Network Equalizers and Successive Interference Cancellation for Bandlimited Channels with a Nonlinearity |
| 1283 | New Algorithms for Computing Sibson Capacity and Arimoto Capacity |
| 1220 | New Bounds on Quantum Sample Complexity of Measurement Classes |
| 1062 | New Construction of $q$-ary Codes Correcting a Burst of at most $t$ Deletions |
| 1310 | New Constructions for Linear Maximum Sum-Rank Distance Codes |
| 1481 | New EVENODD+ Codes with More Flexible Parameters and Lower Complexity |
| 1000 | New Partial Orders of Polar Codes for BMSC |
| 1562 | New Results on Coded Caching in Partially Cooperative D2D Networks |
| 1192 | New Results on the Imbalance of FCSR Sequences and LFSR Subsequences |
| 1887 | New Security Proof of a Restricted High-Dimensional QKD Protocol |
| 2011 | Neyman-Pearson Causal Inference |
| 1409 | Nobody Expects a Differential Equation: Minimum Energy-Per-Bit for the Gaussian Relay Channel with Rank-1 Linear Relaying |
| 1225 | Noise-Tolerant Codebooks for Semi-Quantitative Group Testing: Application to Spatial Genomics |
| 1840 | Non-Binary Covering Codes for Low-Access Computations |
| 2078 | Non-Convex Robust Hypothesis Testing using Sinkhorn Uncertainty Sets |
| 1342 | Non-Linear Analog Processing Gains in Task-Based Quantization |
| 1174 | Nonlinear Codes with Low Redundancy |
| 1707 | Novel Bounds for Semi-Blind Multiple-Access in Massive MIMO |
| 1635 | Numerical Stability of DFT Computation for Signals with Structured Support |
| 1722 | On $2 \times 2$ MIMO Gaussian Channels with a Small Discrete-Time Peak-Power Constraint |
| 1632 | On Achievable Rates for the Shotgun Sequencing Channel with Erasures |
| 1782 | On Channel Simulation with Causal Rejection Samplers |
| 2098 | On Convergence of Discrete Schemes for Computing the Rate-Distortion Function of Continuous Source |
| 1622 | On Counting Subsequences and Higher-Order Fibonacci Numbers |
| 1278 | On de Bruijn Covering Sequences and Arrays |
| 1708 | On Decentralized Linearly Separable Computation With the Minimum Computation Cost |
| 1920 | On Demand-Private Hotplug Caching Systems |
| 1572 | On Doeblin Curves and Their Properties |
| 1892 | On Existence of Latency Optimal Uncoded Storage Schemes in Geo-Distributed Data Storage Systems |
| 1630 | On Fixed Length Systematic All Limited Magnitude Zero Deletion/Insertion Error Control Codes |
| 1889 | On guessing random additive noise decoding |
| 1766 | On k-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction |
| 1923 | On Low Field Size Constructions of Access-Optimal Convertible Codes |
| 2009 | On ML Decoding of Binary Cyclic-gap Constant Weight Codes |
| 1755 | On Multi-Message Private Computation |
| 1129 | On Noisy Duplication Channels with Markov Sources |
| 1247 | On one-orbit cyclic subspace codes of $\mathcal{G}_q(n,3)$ |
| 1427 | On Permutation Capacity Regions of Multiple-Access Channels |
| 1675 | On Securing Analog Lagrange Coded Computing from Colluding Adversaries |
| 1738 | On Semi-supervised Estimation of Discrete Distributions under f-divergences |
| 1639 | On Streaming Codes for Burst and Random Errors |
| 1778 | On Streaming Codes for Simultaneously Correcting Burst and Random Erasures |
| 1902 | On the affine permutation group of certain decreasing Cartesian codes |
| 1320 | On the Asymptotic Nonnegative Rank of Matrices and its Applications in Information Theory |
| 1634 | On the Capacity of Channels with Markov Insertions, Deletions and Substitutions |
| 1783 | On the Capacity of Gaussian “Beam-Pointing” Channels with Block Memory and Feedback |
| 2054 | On the capacity region of some classes of interference channels |
| 1656 | On the Classification of $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-Linear Hadamard Codes |
| 2142 | On the Coverage Required for Diploid Genome Assembly |
| 1400 | On the equivalence between probabilistic shaping and geometric shaping: a polar lattice perspective |
| 2036 | On the Existence of Cyclic Lattice Codes |
| 2197 | On the existence of some completely regular codes in Hamming graphs |
| 2106 | On the Extreme Points of the (0, δ)-Differential Privacy Polytope |
| 1277 | On the Fundamental Tradeoff of Joint Communication and Quickest Change Detection |
| 1971 | On the Generalized Sampling Expansion (GSE) for Graph Signals |
| 1096 | On the Long-Term Behavior of $k$-tuples Frequencies in Mutation Systems |
| 1395 | On the Lossy Compression of Spatial Networks |
| 1522 | On the Non-Computability of Convex Optimization Problems |
| 2065 | On the Optimal Tradeoffs among Error Exponents in Active Sequential Multiple Hypothesis Testing |
| 1300 | On the Optimality of Dictator functions and Isoperimetric Inequalities on Boolean Hypercubes |
| 1654 | On the Optimality of Secure Aggregation with Uncoded Groupwise Keys Against User Dropouts and User Collusion |
| 1739 | On the Parameters of Codes for Data Access |
| 1879 | On the Privacy Guarantees of Differentially Private Stochastic Gradient Descent |
| 1248 | On the Rate-Distortion Function for Sampled Cyclostationary Gaussian Processes with Memory |
| 2038 | On the Relation Between the Common Information Dimension and Wyner Common Information |
| 1994 | On the Secrecy Capacity of 1-2-1 Atomic Networks |
| 1988 | On the Separability of Beamforming for Reconfigurable Intelligent Surfaces under Statistical CSI |
| 1545 | On the Success Probability of the $L_0$-regularized Box-constrained Babai Point |
| 2192 | On Two-stage Quantum Estimation and Asymptotics of Quantum-enhanced Transmittance Sensing |
| 1772 | On Universal Decoding over Memoryless Channels with the Krichevsky–Trofimov Estimator |
| 1071 | On-access error correction in certain types of content-addressable memories |
| 1785 | One Code Fits All: Strong Stuck-at Codes for Versatile Memory Encoding |
| 2010 | One Shot Joint Source Channel Coding |
| 2191 | One-Shot Coding over General Noisy Networks |
| 2177 | One-shot multiple access channel simulation |
| 2076 | One-Shot Wyner–Ziv Compression of a Uniform Source |
| 1394 | Optimal Almost-Balanced Sequences |
| 1862 | Optimal Denial-of-Service Attacks Against Status Updating |
| 1931 | Optimal Distributed Quantizer Design for Binary Classification of Conditionally Independent Vector Sources |
| 1723 | Optimal full-length cyclic orbit flag codes |
| 1770 | Optimal Information Theoretic Secure Aggregation with Uncoded Groupwise Keys |
| 1496 | Optimal Lower Bound of the Average Indeterminate Length Lossless Quantum Block Encoding |
| 2002 | Optimal Memory-Rate Tradeoff in Secure Coded Caching for Small Buffer or Small Rate |
| 1235 | Optimal Private Discrete Distribution Estimation with One-bit Communication |
| 1786 | Optimal Redundancy in Exact Channel Synthesis |
| 2004 | Optimal Stopping Rules for Best Arm Identification in Stochastic Bandits under Uniform Sampling |
| 1936 | Optimal Update Policy for the Monitoring of Distributed Sources |
| 1326 | Optimality of meta-converse for channel simulation |
| 1854 | Optimized Parameter Design for Channel State Information-Free Location Spoofing |
| 1386 | Optimizing Information Freshness in Mobile Networks with Age-Threshold ALOHA |
| 1817 | Optimizing the Decoding Probability and Coverage Ratio of Composite DNA |
| 1620 | Optimum Fingerprinting Function for Winternitz One-Time Signature |
| 2133 | Outer Code Designs for Augmented and Local-Global Polar Code Architectures |
| 2017 | Overflow-Avoiding Memory AMP |
| 1399 | PAC Code Rate-Profile Design Using Search-Constrained Optimization Algorithms |
| 1204 | PAC Learnability for Reliable Communication over Discrete Memoryless Channels |
| 1478 | Pair-Covering Codes |
| 1044 | Parameter Estimation Based on Noisy Chaotic Signals in the Weak-Noise Regime |
| 1060 | Parity-check matrix for Z/p^s-additive codes: efficient computation |
| 1745 | Peak Age of Information under Tandem of Queues |
| 1787 | Perfect Multi-User Distributed Computing |
| 1507 | Perfect Subset Privacy in Polynomial Computation |
| 1668 | Performance Analysis of Generalized Product Codes with Irregular Degree Distribution |
| 1662 | Performance Limits in 3D Localization via Molecular Diffusion |
| 1663 | Permutation Codes in Levenshtein, Ulam and Generalized Kendall-tau Metrics |
| 1544 | Personalized heterogeneous Gaussian mean estimation under communication constraints |
| 1333 | Placement Delivery Arrays for Coded Caching with Shared and Private Caches |
| 1069 | Points-Polynomials Incidence Theorem with an Application to Reed-Solomon Codes |
| 1446 | Potential Functions and Percolation Thresholds of Coded Poisson Receivers |
| 1550 | PoW Security-Latency and Transaction Rate |
| 1073 | Power-limited Modulation-Estimation with a Helper |
| 1809 | Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing |
| 1916 | Precoded Polar Product Codes |
| 1335 | Preconditioned Gradient Descent for Sketched Mixture Learning |
| 2159 | Pre-Decoder Processing Functions for a DMC with Mismatched Decoding |
| 1566 | Predicting Uncertainty of Generative LLMs with MARS: Meaning-Aware Response Scoring |
| 1332 | Prediction with noisy expert advice |
| 1958 | Private Approximate Nearest Neighbor Search for Vector Database Querying |
| 1304 | Private Multiple Linear Computation: A Flexible Communication-Computation Tradeoff |
| 1640 | Private Repair of a Single Erasure in Reed Solomon Codes |
| 1831 | Private Sum Computation: Trade-Off between Shared Randomness and Privacy |
| 1736 | Probabilistic Design of Multi-Dimensional Spatially-Coupled Codes |
| 1551 | Progressive Reconstruction of Large QC-LDPC Codes over a Noisy Channel |
| 1797 | Projective Systematic Authentication via Reed-Muller Codes |
| 2113 | Properties of the Strong Data Processing Constant for Rényi Divergence |
| 1403 | Protocol Sequences for Age of Information under Multiple-Packet Reception |
| 1577 | Proving Information Inequalities by Gaussian Elimination |
| 1123 | Pseduo-Random and de Bruijn Array Codes |
| 2153 | Pseudoredundancy for the Bit-Flipping Algorithm |
| 2094 | QML-IB: Quantized Collaborative Intelligence between Multiple Devices and the Mobile Network |
| 1393 | Quality Adaptation for Cache-aided Degraded Broadcast Channels |
| 1315 | Quantifying Privacy via Information Density |
| 2042 | Quantitative Group Testing with Tunable Adaptation |
| 1673 | Quantum Channel Simulation in Fidelity is no more difficult than State Splitting |
| 1331 | Quantum Codes Derived from One-Generator Quasi-Twisted Codes |
| 2138 | Quantum Doeblin coefficients: A simple upper bound on contraction coefficients |
| 2024 | Quantum Illumination Advantage for Classification Among an Arbitrary Library of Targets |
| 1103 | Quantum Intersection and Union |
| 1416 | Quantum Private Membership Aggregation |
| 1950 | Quantum Soft Covering and Decoupling with Relative Entropy Criterion |
| 2051 | Quantum State Compression with Polar Codes |
| 1918 | Quantum Wiretap Channel Coding Assisted by Noisy Correlation |
| 1286 | Quasi-OSD of Binary Image of RS Codes with Applications to JSCC |
| 1177 | Quickest Detection in High-Dimensional Linear Regression Models via Implicit Regularization |
| 1686 | Random Staircase Generator Matrix Codes |
| 1895 | Rate of convergence of an over-parametrized convolutional neural network image classifier learned by gradient descent |
| 1330 | Rate-Distortion-Perception Tradeoff for Lossy Compression Using Conditional Perception Measure |
| 2040 | Rate-Limited Optimal Transport for Quantum Gaussian Observables |
| 1798 | Rate-limited Shuffling for Distributed Computing |
| 2041 | Receiver algorithms to approach the quantum limit of demodulating pulse position modulation |
| 1974 | Reconstruction of multiple strings of constant weight from prefix-suffix compositions |
| 1607 | Recursive Subproduct Codes with Reed-Muller-like Structure |
| 1238 | Reed-Solomon Codes over Cyclic Polynomial Ring with Lower Encoding/Decoding Complexity |
| 1953 | Regularized Linear Regression for Binary Classification |
| 1764 | Reinforcement Learning for Near-Optimal Design of Zero-Delay Codes for Markov Sources |
| 2161 | Rejection-Sampled Universal Quantization for Smaller Quantization Errors |
| 1378 | Repairing a Single Erasure in Reed-Solomon Codes with Side Information |
| 1173 | Repairing Reed-Solomon Codes with Less Bandwidth |
| 1032 | Repairing Schemes for Tamo-Barg Codes |
| 1432 | Repairing with Zero Skip Cost |
| 1143 | Representing Information on DNA using Patterns Induced by Enzymatic Labeling |
| 1106 | Repurposing Physical Layer Secret Keys: A Novel Paradigm for Common Randomness Generation |
| 1576 | Resource-Efficient Entanglement-Assisted Covert Communications over Bosonic Channels |
| 2173 | Reverse PAC Codes: Look-ahead List Decoding |
| 1871 | Risk Bound on MDL Estimator for Simple ReLU Networks |
| 1598 | Robust Distributed Gradient Descent to Corruption over Noisy Channels |
| 1125 | Robust Multi-Hypothesis Testing with Moment-Constrained Uncertainty Sets |
| 1658 | Robust Semi-supervised Learning via $f$-Divergence and $\alpha$-R\'enyi Divergence |
| 1087 | Robust Syndrome Extraction via BCH Encoding |
| 2196 | Robust VAEs via Generating Process of Noise Augmented Data |
| 2032 | Sample Complexity of Locally Differentially Private Quantum Hypothesis Testing |
| 1380 | Second-Order Characterization of Minimax Parameter Estimation in Restricted Parameter Space |
| 1036 | Second-Order Identification Capacity of AWGN Channels |
| 1467 | Section-wise Revolving NBP-like Decoders for QC-LDPC Codes |
| 1221 | Secure Communication with Unreliable Entanglement Assistance |
| 1810 | Secure Distributed Matrix Multiplication with Precomputation |
| 1836 | Secure Inference for Vertically Partitioned Data Using Multiparty Homomorphic Encryption |
| 1354 | Secure Network Function Computation: Function-Security |
| 2137 | Secure Storage using Maximally Recoverable Locally Repairable Codes |
| 1190 | Secure Submodel Aggregation for Resource-Aware Federated Learning |
| 1852 | Self Improvement of the McEliece-Yu Inequality |
| 2185 | Sequence Reconstruction over 3-Deletion Channels |
| 1655 | Sequential Adversarial Hypothesis Testing |
| 1557 | Set Transformation: Trade-off Between Repair Bandwidth and Sub-packetization |
| 1626 | Several Interpretations of Max-Sliced Mutual Information |
| 1932 | Shared Information under Simple Markov Independencies |
| 1949 | Sharp analysis of out-of-distribution error for "importance-weighted" estimators in the overparameterized regime |
| 1849 | Sharp information-theoretic thresholds for shuffled linear regression |
| 1355 | Sharper rates of convergence for the tensor graphical Lasso estimator |
| 1578 | Short Regular Girth-8 QC-LDPC Codes From Exponent Matrices with Vertical Symmetry |
| 1882 | Short Systematic Codes for Correcting Random Edit Errors in DNA Storage |
| 2167 | SignSGD-FV: Communication-Efficient Distributed Learning through Heterogeneous Edges |
| 2101 | Simulation of Separable Quantum Measurements on Bipartite States via Likelihood POVMs |
| 1946 | Simultaneous Computation and Communication over MAC |
| 1292 | Sliding Secure Symmetric Multilevel Diversity Coding |
| 1034 | Soft Guessing Under Log-Loss Distortion Allowing Errors |
| 1193 | Sparse Gaussian Gradient Code |
| 2190 | Sparsely Pre-transformed Polar Codes for Low-Complexity SCL Decoding |
| 1346 | Sparsity-Based Secure Gradient Aggregation for Resource-Constrained Federated Learning |
| 1875 | Sparsity-Constrained Community-Based Group Testing |
| 2066 | Spectral Convergence of Simplicial Complex Signals |
| 2079 | Statistic Maximal Leakage |
| 1774 | Streaming Codes for Three-Node Relay Networks With Burst Erasures |
| 1322 | Strong Polarization for Shortened and Punctured Polar Codes |
| 1631 | Subgraph Matching via Partial Optimal Transport |
| 1901 | Subset Adaptive Relaying for Streaming Erasure Codes |
| 1689 | Subspace Coding for Spatial Sensing |
| 1556 | Successive Cancellation Sampling Decoder: An Attempt to Analyze List Decoding Theoretically |
| 1975 | Supervised Contrastive Representation Learning: Landscape Analysis with Unconstrained Features |
| 2124 | Symmetric Entropy Regions of Degrees Six and Seven |
| 1319 | Syndrome-based Fusion Rules in Heterogeneous Distributed Quickest Change Detection |
| 1161 | Systematic Transmission With Fountain Parity Checks for Erasure Channels With Stop Feedback |
| 1996 | Task-Based Quantizer Design for Sensing With Random Signals |
| 1414 | Testing Dependency of Weighted Random Graphs |
| 1908 | TexShape: Information Theoretic Sentence Embedding for Language Models |
| 2034 | The Benefit of More Bad Choices in Observational Learning |
| 1494 | The Bethe Partition Function and the SPA for Factor Graphs based on Homogeneous Real Stable Polynomials |
| 1178 | The Capacity of Symmetric Private Information Retrieval with Private Noisy Side Information |
| 1207 | The Capacity of the Weighted Read Channel |
| 1956 | The Entrapment Problem in Random Walk Decentralized Learning |
| 1298 | The Langberg-Medard Multiple Unicast Conjecture for Networks with Collapsed Backbone |
| 1114 | The Lattice-Input Discrete-Time Poisson Channel |
| 1743 | The Likelihood Gain of a Language Model as a Metric for Text Summarization |
| 1370 | The Method of Types for the AWGN Channel: Error Exponent |
| 1244 | The optimal finite-sample error probability in asymmetric binary hypothesis testing |
| 1796 | The Persuasion Bottleneck |
| 1685 | The Rate-Distortion-Perception Trade-off: The Role of Private Randomness |
| 1203 | The State-Dependent Channel with a Rate-Limited Cribbing Helper |
| 1164 | The Unique Form of the Uncorrelated Optimal ZCZ Sequence Families |
| 2007 | Theoretical Guarantees of Data Augmented Last Layer Retraining Methods |
| 1287 | Thermal-Aware Channel with Multiple Wires |
| 1881 | Threshold Saturation for Quantitative Group Testing with Low-Density Parity-Check Codes |
| 2117 | Throughput and Latency of Network Coding in Line Networks with Outages |
| 1679 | Tight Differentiable Relaxation of Sum Ergodic Capacity Maximization for Clustered Cell-Free Networking |
| 1236 | Tight Lower Bound on Cross-Rack Update Bandwidth and Explicit Constructions |
| 1028 | Timely Gossip with Age-Dependent Networks |
| 1485 | Time-Shifted Alternating Gelfand-Pinsker Coding for Broadcast Channels |
| 1821 | Towards General Function Approximation in Nonstationary Reinforcement Learning |
| 1943 | Towards Optimal Inverse Temperature in the Gibbs Algorithm |
| 2199 | Towards Optimal Non-interactive Secure Multiparty Computation for Abelian Programs |
| 2023 | Training Generative Models from Privatized Data via Entropic Optimal Transport |
| 1847 | Transmitter Actions for Secure Integrated Sensing and Communication |
| 1187 | Tree Trace Reconstruction - Reductions to String Trace Reconstruction |
| 1158 | Trellis-Based Construction of Polar Codes for SCL Decoding |
| 1224 | Two-Dimensional Multi-Access Coded Caching with Multiple Transmit Antennas |
| 1316 | Two-weight rank-metric codes |
| 1694 | Unbiased Estimating Equation on Inverse Divergence and Its Conditions |
| 1789 | Unconditional Security using (Random) Anonymous Bulletin Board |
| 1702 | Unequal Message Protection: One-Shot analysis via Poisson Matching Lemma |
| 1376 | Uniform Distribution on $(n-1)$-Sphere: Rate-Distortion under Squared Error Distortion |
| 2109 | Universal Batch Learning Under The Misspecification Setting |
| 1385 | Universal Framework for Parametric Constrained Coding |
| 1444 | Universal Source Encryption under Side-Channel Attacks |
| 1329 | Universal Transmission and Combining for Ultra-Reliable MIMO Relaying |
| 1963 | Unsourced Random Access in MIMO Quasi-Static Rayleigh Fading Channels with Finite Blocklength |
| 1571 | Upper Bound on Coding Rate over Resistive Random-Access Memory Channel under Arbitrary Input Distribution |
| 1341 | Upper bounds on the rate of linear q-ary k-hash codes |
| 1309 | Upper bounds on the size of entanglement-assisted codeword stabilized codes using semidefinite programming |
| 1966 | Utilitarian Privacy and Private Sampling |
| 2021 | VALID: a Validated Algorithm for Learning in Decentralized Networks with Possible Adversarial Presence |
| 1447 | Variable-Length Secret Key Agreement via Random Stopping Time |
| 2077 | Variational Characterizations of Sibson’s α-Mutual Information |
| 1717 | Violation of Leggett-Garg Inequalities Implies Information Erasure |
| 1878 | Voronoi Constellations of Generalized Construction D' Lattices from q-ary Codes |
| 1152 | Weakly Private Information Retrieval from Heterogeneously Trusted Servers |
| 2031 | Weight Structure of Low/High-Rate Polar Codes and Its Applications |
| 2135 | Weighted-Hamming Metric for Parallel Channels |
| 1890 | What can Information Guess ? Guessing Advantage vs. Rényi Entropy for Small Leakages |
| 1757 | When does a bent concatenation not belong to the completed Maiorana-McFarland class? |
| 1952 | When to Preempt in a Status Update System? |
| 2014 | Window Weight Limited Gray Codes And Robust Positioning Sequences |
| 1509 | Wiretapped Commitment over Binary Channels |
| 1321 | Worst-Case Per-User Error Bound for Asynchronous Unsourced Multiple Access |
| 2089 | Write Voltage Optimization to Increase Flash Lifetime in a Two-Variance Gaussian Channel |
| 1814 | Ziv–Merhav estimation for hidden-Markov processes |