A Universal Threshold Theory for Local Properties of Random Linear Codes
cs.IT, cs.CC, math.CO, math.IT
Submitted: 2026-11-05
Updated: 2026-11-05
Terminology
Sources
- From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids
- Efficient Linear and Affine Codes for Correcting Insertions/Deletions
- Thresholds and expectation-thresholds of monotone properties with small minterms
- Locality of Curve-Decoding and Improved Proximity Gaps
- Punctured Low-Bias Codes Behave Like Random Linear Codes
- On the List-Decodability of Random Linear Rank-Metric Codes
- Linear Hashing Is Optimal
- Probabilistic Guarantees to Explicit Constructions: Local Properties of Linear Codes
- Thresholds and expectation thresholds
- Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$
- Random Reed-Solomon Codes and Random Linear Codes are Locally Equivalent
- LDPC Codes Achieve List Decoding Capacity
- Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes
- A Proof of the Kahn-Kalai Conjecture
- Pseudorandom Linear Codes are List Decodable to Capacity
- Thresholds in the Lattice of Subspaces of $(\mathbb F_q)^n$
Related papers
- The Gaussian Multiuser Channel Capacity Region
- The mathematical landscape of partial information decomposition: A comprehensive review of properties and measures
- Electromagnetic Signal and Information Theory: A Continuous-Aperture Array Perspective
- Analytically Characterized Optimal Power Control for Signal-Level-Integrated Sensing, Computing and Communication in Federated Learning
- Information Spectrum Methods for Multiple-Access Channels--Part I: epsilon-Capacity Regions in the Mixed Gaussian Case
- Seed Recycling: Explicit Codes for Mixed Synchronization Errors Matching the Leading Term of the Gilbert--Varshamov Bound