archive
Every paper Pith has read. Search by title, abstract, or pith.
1340 papers in cs.IT · page 7
-
Constacyclic codes support infinite 3-design families
Infinite families of constacyclic codes supporting 3-designs and their applications in coding theory
-
Odd-budget voting curve recovers signed latent signature uniquely
When Can Voting Help, Hurt, or Change Course? Exact Structure of Binary Test-Time Aggregation
-
Adapting semantic rate cuts wireless delay and AoI
When Semantic Communication Meets Queueing: Cross-Layer Latency and Task Fidelity Optimization
-
Benign regularizer exposes hidden local convexity in nonconvex matrix estimation
Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation
-
Information theory bounds learning generalization and estimation risk
Information-theoretic Limits of Learning and Estimation
-
Unconditional tangent scores bound conditional diffusion error by mutual information
Conditional Diffusion Under Linear Constraints: Langevin Mixing and Information-Theoretic Guarantees
-
Bit relabeling cuts D4 and E8 lattice errors by 0.5 dB
Optimizing Bit-Labeling of Voronoi Constellations
-
Linear memory reaches n capacity with listwise but only n/log n with top-1
Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval
-
Contiguous-block PIR achieves optimal rate with minimal subpacketization
Private Contiguous-Block Retrieval
-
Bernoulli channel DI capacity is exactly 1/2
Deterministic identification for Bernoulli channels and related channels with continuous input
-
Structured demand families raise private retrieval rates
Private Structured-Subset Retrieval
-
Structured demands raise private retrieval rates
Private Structured-Subset Retrieval
-
Ring gossip version age scales as sqrt(n)
Age of Gossip in Ring Networks With Non-Poisson Updates
-
Joint BP matches four-state BP for CSS decoding
A Factor-Graph Formulation of CSS Syndrome Decoding: Joint BP and Four-State BP
-
Mutual information tracks MoE generalization gap
Expert Routing for Communication-Efficient MoE via Finite Expert Banks
-
Distributed MIMO yields higher sensing SNR than co-located arrays in ISAC networks
A Comparison Between Co-Located and Distributed MIMO Deployments in OFDM-ISAC Networks
-
Information theory measures tonal ambiguity on a continuous scale
Uniqueness on a Continuum: Quantifying Tonal Ambiguity Using Information Theory
-
Unbiased estimation bounds recoverable parameters by noiseless limits
On Unbiased Parameter Estimation and Signal Reconstruction
-
Adaptive mixture test achieves optimal quantum error exponents
Optimal Error Exponents for Composite Sequential Quantum Hypothesis Testing
-
Adaptive test achieves optimal error exponents in quantum composite testing
Optimal Error Exponents for Composite Sequential Quantum Hypothesis Testing
-
Fluid antennas plus phased array let single-RF UEs cancel interference
Phased Ultra Massive Array (PUMA)
-
Closed-form distance PDFs derived for concentric disk-annulus regions
Distance Distributions Between Nodes in Concentric Disk-Annulus or Sphere-Shell Regions
-
Secure source coding rate condition independent of error and leakage
A Framework of Secure Source Coding using Mutual Information Security Criterion: Universal Coding, Strong Converse Theorem
-
Secure source coding has rate condition independent of error and leakage tolerances
A Framework of Secure Source Coding using Mutual Information Security Criterion: Universal Coding, Strong Converse Theorem
-
SRGGs above connectivity threshold obey Slepian-Wolf rates
Entropy and Distributed Source Coding of Connected Soft Random Geometric Graphs
-
Transformers enable channel-gain mapping in new places with 5x less data
Learning the Channel Gain from Anywhere to Anywhere via Cross-environment Transformer Estimators
-
F4-concatenated codes produce optimal binary LRCs
Constructions of locally repairable codes via concatenated codes
-
Bloch sphere packing yields near-optimal 2D Grassmannian constellations
Z-Opt: A Near-Optimal Reduced-Complexity Two-Dimensional Grassmannian Constellation
-
Quadratic measurements suffice to reconstruct MPO quantum states
Online Riemannian Gradient Descent for Quantum State Tomography with Matrix Product Operators
-
Coupled entropy uniquely satisfies uncertainty and extensivity for complex systems
The unique, universal entropy for complex systems
-
Coupled entropy uniquely fits all complex-system scaling axioms
The unique, universal entropy for complex systems
-
Contextual memory cuts error sensitivity in low-SNR source coding
Contextual Memory-Enhanced Source Coding for Low-SNR Communications
-
Adaptive loading keeps white noise gain above a set floor
Adaptive Diagonal Loading for Norm Constrained Beamforming
-
Joint state and map design boosts average entanglement under unknown partitions
Quantum Compression for Distributed Entanglement
-
Conjugate-piggybacking cuts repair bandwidth in high-rate MDS codes
Joint Design of Piggyback and Conjugate Transformation Functions for Repair Bandwidth Reduction in Piggybacking Codes
-
Sparse FFT reaches O(sqrt(N) log k) expected time with deterministic safety
Deterministic Sparse FFT via Keyed Multi-View Gating with $O(\sqrt{N} \log k)$ Expected Time
-
No infinite gamma-Littlestone tree means realizable Bayes consistency
Realizable Bayes-Consistency for General Metric Losses
-
Consistent metric loss learning possible iff no infinite Littlestone trees
Realizable Bayes-Consistency for General Metric Losses
-
Complex analysis yields exact formulas for polarized channel parameters
Complex Analysis of Channel Polarization on Discrete BMS Channels
-
Exact Bhattacharyya formulas derived for polarized BMS channels
Complex Analysis of Channel Polarization on Discrete BMS Channels
-
Quantum estimator nears optimal complexity for Tsallis entropy
Quantum Multi-Level Estimation of Functionals of Discrete Distributions
-
Quasi-dyadic matrices yield better quantum LDPC codes
Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices
-
Quasi-dyadic matrices yield superior quantum LDPC codes
Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices
-
Automorphisms push neural decoders near maximum-likelihood performance
Leveraging Code Automorphisms for Improved Syndrome-Based Neural Decoding
-
New LP bounds tighten covering radius for non-tight orthogonal arrays
New bounds on the covering radius of orthogonal arrays of even strength
-
Shortlex code undercuts DL code on finite-block lengths
Pareto-type finite-block optimality for source codes: a constrained Markov example
-
One physical sensor can stand in for many with under 3.2% error
Information Density as a Quantitative Measure for AI-enabled Virtual Sensing: Feasibility and Limits
-
Tree model gives Wasserstein bounds on federated learning error
A Hierarchical Sampling Framework for bounding the Generalization Error of Federated Learning
-
One systematic code meets multiple partition distance requirements with less redundancy
Generalized Function-Correcting Partition Codes
-
Edge-coloring removes symmetries in GB code decoding
Edge-Based Anisotropic Decoding for Generalized Bicycle Codes