archive
Every paper Pith has read. Search by title, abstract, or pith.
641 papers in cs.IT · page 1
-
Optimal quantum distillation works without state knowledge
Universal quantum resource distillation via composite generalised quantum Stein's lemma
-
Mixture of experts network cuts resource overhead in aerial-terrestrial URLLC systems
Deep Mixture of Experts Network for Resource Optimization in Aerial-Terrestrial CF-mMIMO Systems under URLLC
-
CP-OFDM yields lower ranging CRB than frequency-spread waveforms for large N
CP-OFDM Achieves Lower Ranging CRB Than Frequency-Spread Waveforms in the Large-Sample Regime
-
Secrecy for multimodal wiretap coding splits into three parts
Secure Joint Source-Channel Coding of Multimodal Semantic Sources
-
Analog RF computing slashes client energy for edge AI by ~100x
Analog RF Computing: A New Paradigm for Energy-Efficient Edge AI Over MU-MIMO Systems
-
UAV swarm positions unlock simultaneous full multiplexing and beamforming gains
Capacity Characterization and Formation Optimization for Multi-User MIMO Communications with UAV Swarm
-
Rotatable antennas improve MIMO secrecy rates
Joint Transmit and Receive Antenna Orientation Design for Secure MIMO Communications
-
Univariate bicycle codes parametrize logical operators explicitly
Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds
-
Parallel BP on multiple bases cuts quantum LDPC errors up to 30%
Multiple-Bases Belief Propagation List Decoding for Quantum LDPC Codes
-
Galois actions give non-special divisors for arbitrary Kummer ramification
Construction of Non-special Divisors on Kummer Covers With Arbritary Ramification For LCP Codes
-
Bent functions give optimal parity for Hamming membership checks
Function-Correction with Optimal Data Protection for the General Hamming Code Membership
-
Waterfilling makes LLM weight quantization basis-free and near-optimal
High-Rate Quantized Matrix Multiplication II
-
Uniform convergence at scale γ equals learnability at γ/2
Scale-Sensitive Shattering: Learnability and Evaluability at Optimal Scale
-
Fragmentation strictly raises finite-context log-loss
Effective Context in Transformers: An Analysis of Fragmentation and Tokenization
-
CUR local error filters perturbations invisible to selected rows and columns
Revisiting CUR Perturbation Analysis: A Local Tangent-Space Expansion
-
Alternating training aligns diffusion encoder with decoder
The Diffusion Encoder
-
List decoder spots polar-code information sets from raw signals
Blind Recognition of Polar Codes Using Successive Cancellation List Decoding
-
Fixed weights boost product code decoding by 0.23 dB
Decoding Product Codes and Staircase Codes with Iteration-Independent Weighting Coefficients
-
KL divergence between training kernels bounds distillation generalization
On the Generalization of Knowledge Distillation: An Information-Theoretic View
-
Explicit left ideals for skew polycyclic codes over chain rings
Skew Polycyclic Codes over $\frac{\mathbb{F}_{p^m}[u]}{\langle u^t \rangle}$
-
Ternary maximal self-orthogonal codes of length 25 classified
Classification of ternary maximal self-orthogonal codes of length 25
-
Annulus-modulated transceiver reaches full DoF in RIS symbiotic radios
Grouped Annulus-Modulated Transceiver Is Almost Full DoF-Achieving for RIS-Assisted Symbiotic Radios Over Spatial-Correlated Channels
-
Continuous apertures reshape wireless signal theory
Electromagnetic Signal and Information Theory: A Continuous-Aperture Array Perspective
-
Adaptive multi-marginal couplings cut MCMC meeting times by half
Multi-Marginal Couplings for Metropolis-Hastings
-
Polytope regions create permanent semantic ambiguity in generative communication
Resolution Information: Limits of Ambiguity Resolution for Generative Communication
-
Precoded polar codes rival surface codes with far fewer qubits
Quantum Precoded Polar Codes
-
This paper derives an improved lower bound of order sqrt(n log log n) on the support size…
An Improved Lower Bound on Support Size of Capacity-Achieving Inputs for the Binomial Channel: Extended version
-
Exact repair achieves optimal storage and bandwidth in quantum storage
Simultaneously Minimizing Storage and Bandwidth Under Exact Repair With Quantum Entanglement
-
Field multiplication symmetric tensor rank matches its Gabidulin code rank
Symmetric Tensor Decompositions over Finite Fields
-
Finite-field angular metric yields unique projective decoding
Angle Between Two Vectors over Finite Fields and an Application to Projective Unique Decoding
-
Secure key rate equals d-ℓ in d-vertex-connected networks
Secure (Multiple) Key-Cast over Networks: Multiple Eavesdropping Nodes
-
The paper proposes a recurrent transformer model using a single block with state memory…
Recurrent Transformer-Based Near- and Far-Field THz Wideband Channel Estimation for UM-MIMO
-
CNN spots boundaries in overlapping wireless commands
A Deep Learning-based Receiver for Asynchronous Grant-Free Random Access in Control-to-Control Networks
-
Link failures cap LEO capacity scalability at O(1/n)
Capacity Scalability of LEO Constellations With Dynamic Link Failures
-
Framework extends non-GRS MDS-NMDS codes via deep holes
A framework for constructing non-GRS MDS-NMDS codes from deep holes and its application
-
Exact Hamming distances derived for binary polycyclic codes from trinomials
On the Hamming Distance and LCD Properties of Binary Polycyclic Codes and Their Duals
-
Beamspace sorting yields SNR from one mmWave sample
Low-Complexity Blind SNR Estimator for mmWave Multi-Antenna Communications
-
QOED focuses robot exploration on identifiable parameters
Learning What Matters: Adaptive Information-Theoretic Objectives for Robot Exploration
-
Node failures scale wireless capacity and delay with sqrt of reliable nodes
On Capacity and Delay of Wireless Networks with Node Failures
-
Adversarial test error bounds match exponentially in S
Memory Constrained Adversarial Hypothesis Testing
-
Complex neurons beat simple ones under fixed parameters
Scaling Laws and Tradeoffs in Recurrent Networks of Expressive Neurons
-
CR2 router matches full-info LLM decisions with device signals only
CR^2: Cost-Aware Risk-Controlled Routing for Wireless Device-Edge LLM Inference
-
Conditional subadditivity tightens Szász and Fischer matrix bounds
From Submodularity to Matrix Determinants: Strengthening Han's, Sz\'asz's, and Fischer's Inequalities
-
Explicit generators classify all constacyclic codes of length np^s
Constacyclic codes of length $np^s$ over $\frac{\mathbb{F}_{p^m}[u]}{\langle u^t\rangle}$: Torsions and Cardinalities
-
KL divergence with teacher constraint yields SSL batch centering
Information theoretic underpinning of self-supervised learning by clustering
-
Ternary sum entropy maximized by mostly binary variables
Maximum Entropy of Sums of Independent Ternary Random Variables
-
Polar complexity enables lossless codes approaching source entropy
Polar Complexity: A New Descriptive Complexity with Applications to Source and Joint Source-Channel Coding
-
Polar complexity yields lossless codes approaching entropy
Polar Complexity: A New Descriptive Complexity with Applications to Source and Joint Source-Channel Coding
-
Random coding gives exact finite-length bound for empirical coordination
Empirical coordination in the finite blocklength regime: an achievability result---Extended version
-
Generalized Q-factor estimates multiport antenna bandwidth
Multiport Antenna Q-factor