archive
Every paper Pith has read. Search by title, abstract, or pith.
1340 papers in cs.IT · page 19
-
PAC-Bayesian bound limits wireless error in edge AI inference
A PAC-Bayesian Analysis of Channel-Induced Degradation in Edge Inference
-
Fewer operations decode ABS+ polar codes to same FER
Efficient LLR-Domain Decoding of ABS+ Polar Codes
-
Disjoint codebooks add diversity gain in one-shot broadcast coding
One-Shot Broadcast Joint Source-Channel Coding with Codebook Diversity
-
Sum channel codes fix two deletions with 2 log log n redundant bits
Error-Correcting Codes for the Sum Channel
-
GNN colors conflict graphs for near-optimal coded caching
A Low-Complexity Framework for Multi-access Coded Caching Systems with Arbitrary User-cache Access Topology
-
Zero-error list bounds match when quantum overlaps form PSD matrix
Zero-Error List Decoding for Classical-Quantum Channels
-
Feedback boosts polar codes' finite-length performance
On Polar Coding with Feedback
-
f-divergence MI matrices are PSD for nonnegative power-series generators
A Global Characterization of $f$-Divergences Yielding PSD Mutual-Information Matrices
-
Matching bounds fix sample complexity for composite quantum tests
Sample Complexity of Composite Quantum Hypothesis Testing
-
CSS codes realize logical Clifford group fault-tolerantly
Asymptotically good CSS codes that realize the logical transversal Clifford group fault-tolerantly
-
Typicality tightens private learning generalization bounds
On the Generalization Error of Differentially Private Algorithms via Typicality
-
SFT and RL cannot be decoupled without loss in LLM training
On the Non-decoupling of Supervised Fine-tuning and Reinforcement Learning in Post-training
-
Nonconvex method recovers matrices from outliers with linear entrywise convergence
Fast and Provable Nonconvex Robust Matrix Completion
-
Rate-distortion infima attained on noncompact alphabets
Rate-distortion Theory with Lower Semi-continuous Distortion on Noncompact Alphabets
-
Lossless compression sample complexity set by Rényi entropy of order 1/2
The Sample Complexity of Lossless Data Compression
-
Deletion ball intersection exactly 20n-166 for n at least 13
Some New Results on Sequence Reconstruction Problem for Deletion Channels
-
r-run strings maximize deletion subsequences count
On the Number of Subsequences in the Nonbinary Deletion Channel
-
Pinching antennas achieve 4.7 dB higher secure rates than fixed systems
Robust and Secure Blockage-Aware Pinching Antenna-assisted Wireless Communication
-
Slower drone process sets version age in cellular gossip
Age of Gossip With Cellular Drone Mobility
-
Discrete transport equation classifies all W1 geodesics on graphs
A discrete Benamou-Brenier formulation of Optimal Transport on graphs
-
Minimum lengths found for all-symbol PIR and batch codes
Serving Every Symbol: All-Symbol PIR and Batch Codes
-
Dynamic AP switching raises UAV uplink secrecy rates
Flexible-Duplex Cell-Free Architecture for Secure Uplink Communications in Low-Altitude Wireless Networks
-
Graph theory finds planar BD-RIS designs for double-layer PCBs
Low-Complexity Planar Beyond-Diagonal RIS Architecture Design Using Graph Theory
-
Rank-2 quantum entropies hard to estimate for all orders
Computational hardness of estimating quantum entropies via binary entropy bounds
-
Drinfeld modules yield new infinite semifield codes
Rank metric codes from Drinfeld modules
-
Cyclic code duals have distance 2^ω(n)
On the Euclidean duals of the cyclic codes generated via cyclotomic polynomials
-
Prior knowledge tightens privacy bounds for linear queries
Context-aware Privacy Bounds for Linear Queries
-
One matrix of XORs solves every quadratic over F_{2^m}
A Novel Formula for Solving Quadratic Equations over Binary Extension Fields
-
LFSR frequency bound sets burst-covering radius for BCH codes
On the burst-covering radius of binary cyclic codes
-
Stiffness-odds identity caps preservation efficiency below 50%
The Preservation Tradeoff: A Thermodynamic Bound in the Diminishing-Returns Regime
-
New binary sequences from odd-char elliptic fields
A New Family of Binary Sequences via Elliptic Function Fields over Finite Fields of Odd Characteristics
-
Regularized capacity found for quantum secret sharing
Quantum Secret Sharing Rates
-
Symmetric measure tracks net information change while conserving totals
Conserved active information
-
Electrostatic equilibrium determines optimal movable antenna positions
Near-Field Communication with Massive Movable Antennas: An Electrostatic Equilibrium Perspective
-
Elastic topology merges cell networks for ISAC
Learning-Enabled Elastic Network Topology for Distributed ISAC Service Provisioning
-
Unique information IDs direct causes
Information-theoretic signatures of causality in Bayesian networks and hypergraphs
-
Critical regime limits LRM energy routing to volatility
Energy-Aware Routing to Large Reasoning Models
-
RIS-OTFS-FTN boosts reliability and efficiency in high-mobility links
RIS-Empowered OTFS Modulation With Faster-than-Nyquist Signaling in High-Mobility Wireless Communications
-
RIS-assisted OTFS-FTN scheme raises reliability in fast mobile links
RIS-Empowered OTFS Modulation With Faster-than-Nyquist Signaling in High-Mobility Wireless Communications
-
No universal hyperbola for AI certainty and scope
No Universal Hyperbola: A Formal Disproof of the Epistemic Trade-Off Between Certainty and Scope in Symbolic and Generative AI
-
DP stochastic quantizer protects 802.11 CSI feedback
Protecting Human Activity Signatures in Compressed IEEE 802.11 CSI Feedback
-
Condition on power differences yields locally-APN binomials with boomerang uniformity 2
Locally-APN Binomials with Low Boomerang Uniformity in Odd Characteristic
-
Exact minimum lines in PG(4,2) ensure every plane holds s lines
Generalized Hamming weights of additive codes and geometric counterparts
-
Time-frequency units give shallow nets N^{-1/2} Sobolev rates
Time-Frequency Analysis for Neural Networks
-
-
Modified GRS codes yield two new MDS families with non-GRS examples
Two Families of Linear Codes Containing Non-GRS MDS Codes
-
Codes approach capacity with inverse-Ackermann depth encoders
Capacity-Achieving Codes with Inverse-Ackermann-Depth Encoders
-
Mathematics builds from zero and one as absence and presence
The Universal Language of Mathematics (Introduction to Binary Principle)
-
PANDAExpress drops polylog factor from query runtime
PANDAExpress: a Simpler and Faster PANDA Algorithm
-
Weak measurements accumulate information at measurable rates
Information-Theoretic Analysis of Weak Measurements and Their Reversal