archive
Every paper Pith has read. Search by title, abstract, or pith.
586 papers in math.IT · page 1
-
CUR local error filters perturbations invisible to selected rows and columns
Revisiting CUR Perturbation Analysis: A Local Tangent-Space Expansion
-
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
-
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
-
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
-
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
-
Random coding gives exact finite-length bound for empirical coordination
Empirical coordination in the finite blocklength regime: an achievability result---Extended version
-
Midpoint chirp choice makes AFDM waveforms continuous and lower in OOBE
Stepped Frequency Division Multiplexing: A Jump-Free Continuous-Time AFDM Waveform
-
Explicit measure makes entropy fifth derivative positive
A Counterexample to the Gaussian Completely Monotone Conjecture
-
Constacyclic DFT extends cyclic square methods to Schur products
Schur Products of Constacyclic Codes via the Constacyclic Discrete Fourier Transform
-
Heterogeneous quantization matches full-precision MIMO detection with fewer bits
Performance of QUBO-Formulated MIMO Detection Under Hardware Precision Constraints
-
Group symmetries unify all standard signal transforms
Unification of Signal Transform Theory
-
VIB metrics reach 95.3% AUROC for MNIST OOD detection
VNDUQE: Information-Theoretic Novelty Detection using Deep Variational Information Bottleneck
-
Floating-point entropy stays nearly constant under scaling
The Entropy of Floating-Point Numbers
-
Spatially coupled codes deliver strong performance for future systems
Recent Advances in Spatially Coupled Codes: Overview and Outlook
-
Structural conditions give explicit permutation quadrinomials over F_{q^2}
Explicit determination of a class of permutation rational functions in any characteristic
-
Decoder fixes deletions plus insertions in quantum codes
Decoding Algorithm to Composite Errors Consisting of Deletions and Insertions for Quantum Deletion-Correcting Codes Based on Quantum Reed-Solomon Codes
-
Vector codebook cuts KV cache to 34x compression at 0.95 similarity
FibQuant: Universal Vector Quantization for Random-Access KV-Cache Compression
-
Rational functions produce better optimal LRCs than polynomials
Beyond Polynomials: Optimal Locally Recoverable Codes from Good Rational Functions
-
Infinite families of optimal codes with positive Griesmer defects
Optimal Codes with Positive Griesmer Defects, Related Optimal and Almost Optimal LRC Codes
-
Polar codes gain exact leakage certification for public coordinate subsets
RankGuardPolar Private Public Finite Length Polar Codes with Rank-Certified Leakage
-
Outputs alone recover channel parameters and optimal inputs
Parameter Estimation of Mutual Information Maximized Channels
-
FRG treats noise-to-signal ratio as temperature for anomaly detection
Field Theory of Data: Anomaly Detection via the Functional Renormalization Group. The 2D Ising Model as a Benchmark
-
Synthesize likelihoods to meet accuracy bounds with minimal prior deviation
Sensor Design for Accuracy-Bounded Estimation via Maximum-Entropy Likelihood Synthesis
-
3D Hamiltonian encodes qubit for exponential time at finite temperature
A passive self-correcting quantum memory in three dimensions
-
Fountain codes bound DNA random access at π/4
Random Access Expectation in DNA Storage and Fountain Codes
-
Flexible privacy sets yield PIR capacity bounds on path and cycle graphs
Private Information Retrieval With Arbitrary Privacy Requirements for Graph-Based Storage
-
Neural weight norm equals Kolmogorov complexity
Neural Weight Norm = Kolmogorov Complexity
-
Local privacy multiplies PIR capacity on graph unions
Local Private Information Retrieval: A New Privacy Perspective for Graph-Based Replicated Systems