2021 ITC Conference - Code Offset in the Exponent
Explore novel fuzzy extractor construction using error-correcting codes and cryptographic groups, supporting MIPURS distributions for enhanced biometric authentication security.
Quantum "Supremacy" - Lecture 25 of Quantum Computation at CMU
Explore quantum supremacy, its challenges, and implications in computational theory. Delve into error correction, threshold theorems, and the potential of quantum systems.
Understand ECC Support for NAND Flash Devices in Linux
Explore NAND flash ECC support in Linux, covering algorithms, engine missions, and configurations for robust error correction in storage devices.
Reed-Muller Codes Polarize
Explore the polarization phenomenon in Reed-Muller codes, uncovering their unique properties and potential applications in coding theory and information transmission.
Relaxed Locally Decodable Codes - Part 2
Explore advanced concepts in relaxed locally decodable codes, building on foundational knowledge to deepen understanding of this important area in coding theory.
Lattices and Codes in Cryptography - TCC 2023 Session
Explore cutting-edge research on lattices and codes in cryptography, featuring presentations from leading experts at the Theory of Cryptography Conference 2023.
Algebraic Codes and Algorithms - Part II
Explore advanced concepts in algebraic coding theory and algorithms, focusing on error-correcting codes and their practical applications in data transmission and storage.
Locality in Codes and Computation
Exploring local algorithms in error-correcting codes and their impact on computational theory, from error detection to cryptocurrency applications. Challenges and future directions discussed.
Parameterized Inapproximability of the Minimum Distance Problem over All Fields
Explores inapproximability of Minimum Distance Problem for linear codes over finite fields, proving W[1]-hardness. Extends results to Shortest Vector Problem on integer lattices.
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.