archive
Every paper Pith has read. Search by title, abstract, or pith.
1340 papers in cs.IT · page 15
-
Projected moments recover rotation-invariant moments of objects
Group-invariant moments under tomographic projections
-
Binomials with max bent components reduce to two known forms
On quadratic binomial vectorial functions with maximal bent components
-
Pairs graph determines capacity of coloring channel sequences
On the Capacity of Sequences of Coloring Channels
-
Bosonic channel superposition enables simultaneous computation and decoding
Quantum Integrated Communication and Computing Over Multiple-Access Bosonic Channel
-
Adaptive 1-bit thresholds achieve order-optimal mean estimation
Order-Optimal Sequential 1-Bit Mean Estimation in General Tail Regimes
-
Adaptive 1-bit thresholds match unquantized mean rates for any k
Order-Optimal Sequential 1-Bit Mean Estimation in General Tail Regimes
-
Reed-Solomon proximity gaps fail near capacity over primes
Proximity Gaps Conjecture Fails Near Capacity over Prime Fields
-
Pareto boundary maps optimal delay-error trade-offs
Modeling and Analysis for Joint Design of Communication and Control
-
Asymmetric bidistance gives new bound on binary code error rates
The Asymmetric Hamming Bidistance and Distributions over Binary Asymmetric Channels
-
Compressed sensing recovers unknown anisotropic functions near-optimally
Universal, sample-optimal algorithms for recovery of anisotropic functions from i.i.d. samples
-
Small quantum computers classify massive data with exponential size savings
Exponential quantum advantage in processing massive classical data
-
LLM pre-training nears optimal compression for prediction
Learning is Forgetting: LLM Training As Lossy Compression
-
Data transmissions replace pilots for delay-Doppler estimation
Delay-Doppler Channel Estimation using Arbitrarily Modulated Data Transmissions
-
Dual streams raise compression ratio and speed
Efficient Learned Data Compression via Dual-Stream Feature Decoupling
-
Random codes achieve positive rate on deletion channel for any p<1
The Random Subsequence Model and Uniform Codes for the Deletion Channel
-
Liquid crystal antennas with neural networks raise sub-THz efficiency
Robust Hybrid Beamforming with Liquid Crystal Antennas and Liquid Neural Networks
-
Adversarial multi-task model beats baselines in interference detection
Joint Interference Detection and Identification via Adversarial Multi-task Learning
-
Multi-agent RL cuts cell-free MIMO power use by 56%
Energy Saving for Cell-Free Massive MIMO Networks: A Multi-Agent Deep Reinforcement Learning Approach
-
Top-p selection beats top-1 for choosing sensors in target tracking
Top-P Sensor Selection for Target Localization
-
Gaussian data does not always give the largest CRB
The Gaussian data assumption does not always lead to the largest CRB
-
Neural nets find no distinguishing edge in PQC KEMs or hybrids
Evaluating PQC KEMs, Combiners, and Cascade Encryption via Adaptive IND-CPA Testing Using Deep Learning
-
Quantum relative-alpha-entropy captures geometric distinguishability
Quantum Relative-alpha-Entropies: A Structural and Geometric Perspective
-
Affine subcodes reach near-ML decoding with 64 BP paths
Affine Subcode Ensemble Decoding of Linear Block Codes
-
Norm reduction yields flexible non-RS cyclic MDS codes
Non-RS type cyclic MDS codes over finite fields via cyclotomic field reduction
-
Cyclotomic reduction gives flexible non-RS cyclic MDS codes
Non-RS type cyclic MDS codes over finite fields via cyclotomic field reduction
-
Pre-trained graph model adapts wireless allocation with few examples
A Graph Foundation Model for Wireless Resource Allocation
-
SCA scheme reaches ideal detection by removing message interference
Tag-based Physical-Layer Authentication Against Message Interference
-
Bound on peak age of information guides optimal AP split for sensing-communication
Network-Wide PAoI Guarantee in CF-mMIMO Networks with S&C Coexistence: A Unified Framework for Spatial Partitioning Toward xURLLC
-
Frozen tags in polar codes improve PLA detection and hide from eavesdroppers
Frozen-Tag-Based Physical-Layer Authentication Against User Interference
-
Models know answers after 10% of reasoning tokens
The Detection-Extraction Gap: Models Know the Answer Before They Can Say It
-
LLM gate assembles expert agents for near-optimal 6G optimization
Agentic AI-Based Joint Computing and Networking via Mixture of Experts and Large Language Models
-
Coset Bombe codes gain 0.8 dB and halve latency on 16-QAM
Multilevel Coset Codes on Lattices
-
Multigraphs recover quantum channel confusability graphs by edge count
A multigraph approach to confusability in quantum channels
-
Bits-back rejection sampler reaches sub-log redundancy for singular channels
Singular Relative Entropy Coding with Bits-Back Rejection Sampling
-
MCC pilots cut covering radius and collinearity for better TDD recovery
Covering-radius and Collinearity- Minimizing Pilots for Channel Estimation in TDD Systems
-
Newton-Schulz iteration cuts cost of orthogonal synchronization
NS-RGS: Newton-Schulz based Riemannian gradient method for orthogonal group synchronization
-
Tensor-train format gives exact low-rank form to joint log-APP
A Tensor-Train Framework for Bayesian Inference in High-Dimensional Systems: Applications to MIMO Detection and Channel Decoding
-
Optimized Cayley graphs speed multi-agent info flow
Cayley Graph Optimization for Scalable Multi-Agent Communication Topologies
-
Deletion channel capacity capped at 0.3578(1-d) for d ≥ 0.64
Improved Capacity Upper Bounds for the Deletion Channel using a Parallelized Blahut-Arimoto Algorithm
-
Gradient EM converges for general agnostic mixtures
Expectation Maximization (EM) Converges for General Agnostic Mixtures
-
20% rate gain from semantic integration in near-field DT vehicular nets
Near-Field Integrated Sensing, Computing and Semantic Communication in Digital Twin-Assisted Vehicular Networks
-
Report compiles all FFCS conference abstracts on comms foundations
Foundations of Future Communication Systems: Innovations in Communication - A Report
-
New bound tightens minimum repair cost for MDS array codes
The Incidence-Multiplicity Bound for Linear Exact Repair in MDS Array Codes
-
Extended twisted Reed-Solomon codes produce new MDS and AMDS codes
Non-GRS type MDS and AMDS codes from extended TGRS codes
-
Maximizing Solow-Polasky diversity is NP-hard in general metrics
Selecting a Maximum Solow-Polasky Diversity Subset in General Metric Spaces Is NP-hard
-
Environment data generates channel knowledge to improve semantic coding
Generative Channel Knowledge Base With Environmental Information for Joint Source-Channel Coding in Semantic Communications
-
Bounded test classes make IPMs evaluable from finite samples
A Theoretical Framework for Statistical Evaluability of Generative Models
-
Diffusion model samples near-optimal wireless power allocations
Graph Signal Diffusion Models for Wireless Resource Allocation
-
Adaptive CCA reaches optimal samples for decaying signals
Beyond the Flat-Spike: Adaptive Sparse CCA for Decaying and Unbalanced Signals
-
PANDA derives optimal query plans from information bounds
Query Optimization and Evaluation via Information Theory: A Tutorial