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.
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.
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.
Algebra in Algorithmic Coding Theory
Explore algebraic techniques in algorithmic coding theory, focusing on error-correcting codes and their applications in computer science and information theory.
LDPC Codes Achieve List Decoding Capacity
Explores LDPC codes' list-decoding capacity, discussing error correction, code families, and local properties of random linear codes. Presents new findings and open problems in coding theory.
Information Storage in DNA
Explore DNA as a revolutionary digital storage medium, its potential for long-term archiving, and recent advances in genome science for preserving vast amounts of information.
HashTag - Hash-based Integrity Protection for Tagged Architectures
Innovative hash-based error detection and correction technique for DRAM, enabling efficient implementation of tagged memory architectures while maintaining strong data integrity protection.
A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors
Explore key recovery attacks on MDPC codes with CCA security, focusing on decoding errors and their implications for cryptographic systems.
Cryptography, Local Decoding, and Distributed Storage
Explore cryptography's role in distributed storage, focusing on error correction, local decoding, and private information retrieval. Learn about Reed-Solomon codes and their applications.
Projective Reed Muller Codes Revisited
Explore projective Reed Muller codes with Sudhir Ghorpade, revisiting key concepts and recent developments in algebraic coding theory.
New Algebraic Attacks on the McEliece Cryptosystem - Invited Talk
Explore cutting-edge algebraic attacks on the McEliece cryptosystem in this invited talk by Jean-Pierre Tillich at PQCrypto 2023.
Local-to-Global Theorems on High Dimensional Expanders
Explore high dimensional expansion theory, from graph fundamentals to complex applications in error-correcting codes and PCPs, focusing on how local properties influence global behaviors in mathematical structures.