List-Decoding Random Code Ensembles - Advances in Error-Correcting Codes
Explore advanced error-correcting code theory, focusing on list-decoding techniques for random code ensembles. Gain insights into cutting-edge research in coding theory.
An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes
Explores exponential lower bounds for linear 3-query locally correctable codes, improving previous results and approaching best-known constructions. Discusses implications for error-correcting codes and related conjectures.
Fast List-Decoding of Univariate Multiplicity and Folded Reed-Solomon Codes
Explore advanced techniques for efficient list-decoding of Reed-Solomon codes, focusing on univariate multiplicity and folded variants in error-correcting code theory.
Tree Codes - Advances in the Theory of Error-Correcting Codes
Explore error-correcting codes and their theoretical advancements, focusing on tree codes and their applications in communication systems.
Relaxed Local Correctability from Local Testing
Explore relaxed locally correctable codes with polylogarithmic query complexity, bridging the gap between lower and upper bounds using locally testable codes at multiple scales.
Coding Theory in Almost Linear Time and Sublinear Space
Explore efficient error-correcting codes with near-linear time and sub-linear space encoding/decoding algorithms. Learn about innovative techniques in hashing, locally correctable codes, and derandomization.
Asymptotically-Good RLCCs with (log n)^{2+o(1)} Queries
Explore asymptotically good relaxed locally correctable codes with improved query complexity, advancing error-correcting code theory through novel techniques and insights.
Codes with the Multiplication Property - Advances in Error-Correcting Codes Theory
Explore error-correcting codes with multiplication properties, focusing on recent advancements and theoretical implications in coding theory.
Dual of Evaluation Codes in Error-Correcting Theory
Explore the mathematical concept of dual codes in error correction, focusing on evaluation codes and their properties in coding theory.
Constant Query Local Decoding Against Deletions Is Impossible
Explores impossibility of constant query locally decodable codes in deletion settings, contrasting with substitution errors. Proves non-existence, impacting error-correcting code theory.
Binary Codes with Resilience Beyond 1/4 via Interaction
Explore advanced error-correcting codes for two-way communication, achieving resilience beyond 1/4 corruptions with constant rate and minimal receiver interaction.
Signal, if You Can't - Error Correction in Fully Corrupted Networks
Explore signaling methods for performing computations in asynchronous networks with corrupted messages, focusing on error-correction techniques for damaged transmissions.
Gilbert and Varshamov Meet Johnson - List Decoding Nearly-Optimal Binary Codes
Explore advanced error-correcting codes, focusing on Ta-Shma's breakthrough and improved list-decoding algorithms that approach the Johnson bound for binary codes with optimal distance and rate.
Binary Error Correcting Codes with Minimal Noiseless Feedback
Explores optimal constructions and lower bounds for limited feedback error-correcting codes, improving upon classical models for both error and erasure settings.
List Decoding of Tanner and Expander Amplified Codes
Explore advanced error-correcting code techniques, focusing on list decoding for Tanner and expander amplified codes, with insights from Shashank Srivastava's research.
Back to the Future: The Evolution of Coding Theory Through Reed Muller Codes
Explore the evolution of coding theory through Reed Muller codes, from sphere packing to iterative algorithms and quantum computing applications.
Logical Quantum Processor Based on Reconfigurable Atom Arrays
Explores advancements in quantum computing using neutral atom arrays, demonstrating improved error correction and logical qubit processing for enhanced algorithmic performance.
Convertible Codes: Adaptive Coding for Large-Scale Data Storage
Explore adaptive coding techniques for efficient data storage, focusing on locally repairable convertible codes that offer protection against failures and flexibility in modifying parameters over time.
Introduction to qLDPC Codes
Explore quantum low-density parity-check codes, their applications in quantum error correction, and recent advancements in the field of quantum coding theory.
Higher Order MDS Codes - Advances in Error-Correcting Code Theory
Explore advanced concepts in error-correcting codes, focusing on Higher Order MDS Codes and their applications in data integrity and communication systems.
Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
Explores advanced bounds for 3-query locally correctable binary linear codes, improving previous results using rainbow cycles in edge-colored graphs and covering radius of dual codes.