PCPs and Global Hyper-contractivity - Lecture 2
Explore advanced concepts in PCPs and global hyper-contractivity with Dor Minzer, delving into complex mathematical theories and their applications in analysis and theoretical computer science.
PCPs and Global Hyper-contractivity - Lecture 1
Explore advanced concepts in theoretical computer science, focusing on Probabilistically Checkable Proofs and global hyper-contractivity with expert Dor Minzer.
Approaching the Quantum Singleton Bound with Approximate Error Correction
Explore efficient quantum codes approaching the Singleton bound, using approximate recovery and quantum list decoding with folded Reed-Solomon codes for near-optimal error correction.
Arikan Meets Shannon - Polar Codes With Near-Optimal Convergence to Channel Capacity
Explore polar codes for efficient data transmission, examining their convergence to channel capacity and applications in binary-input discrete symmetric memoryless channels.
Mathematics of Computation Through the Lens of Linear Equations and Lattices
Explore mathematical foundations of computation through linear equations and lattices, covering error correction, vector problems, and lattice theory with implications for future computing.
Oscillator-to-Oscillator Codes Do Not Have a Threshold
Explores limitations of oscillator-to-oscillator codes in quantum information, proving they lack a threshold property for error correction when using constant squeezing and maximum likelihood decoding.
Collision-Resistance from Multi-Collision-Resistance
Exploring the transformation of multi-collision-resistant hash functions into collision-resistant hash functions, with insights on Reed-Solomon codes and cryptographic primitives.
Overview of Code-Based Crypto Assumptions
Explore code-based cryptography assumptions, including Hamming codes, decoding problems, and cryptosystems. Learn about security analyses and generic attacks in post-quantum cryptography.
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.
Hamming Code and Hadamard Code - Lecture 11c of CS Theory Toolkit
Explore Hamming and Hadamard codes: linear error correction techniques with contrasting rate and distance properties. Learn their applications in theoretical computer science research.
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.
Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree Codes
Explore efficient interactive coding techniques using hard-to-decode tree codes, focusing on deterministic approaches and their applications in communication protocols.
Optimal Document Exchange and New Codes for Insertions and Deletions
Explore optimal document exchange techniques and innovative coding methods for handling insertions and deletions in data transmission and storage systems.
Quasilinear Time List Decodable Codes for Space Bounded Channels
Explore quasilinear time list decodable codes for space bounded channels, advancing understanding of efficient error correction in constrained environments.
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.
Complexity and Coding Theory - Session 6A
Explore cutting-edge research in complexity and coding theory, delving into advanced mathematical concepts and their applications in computer science and information theory.
Coding Theory - Session 4A
Explore cutting-edge advancements in coding theory, examining innovative approaches and their implications for information transmission and error correction in modern communication systems.
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.
Fast Erasure Decoder for a Class of Quantum LDPC Codes - IPAM at UCLA
Explore fast erasure decoding for quantum LDPC codes, focusing on hypergraph product codes and their potential to reduce qubit count in fault-tolerant quantum computers.
High-Dimensional Sipser-Spielman Codes - IPAM at UCLA
Exploration of high-dimensional Sipser-Spielman codes, extending expander codes to cell complexes and cellular sheaves, with applications in quantum error correction and coding theory.