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.
Introduction to Quantum Information Science - Part II
Explore advanced quantum information science concepts with UCLA expert Wes Campbell in this comprehensive lecture, part of IPAM's Winter School on Quantum Information Science for Chemistry.
Introduction to Quantum Information Science - Part I
Comprehensive introduction to quantum information science, covering fundamental concepts and their applications in chemistry, presented by expert Wes Campbell at UCLA's IPAM Winter School.
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.
Brunn-Minkowski Inequalities via Concavity of Entropy
Explore Brunn-Minkowski inequalities through the lens of entropy concavity, gaining insights into geometric and functional analysis concepts.
Expansion of Higher-Dimensional Cubical Complexes with Application to Good Quantum Locally Testable Codes
Explore quantum locally testable codes, their optimal parameters, and connections to expander codes and qLDPC codes in this advanced talk on quantum complexity theory.
Information Theoretic MPC - Techniques That Age Well
Explore cutting-edge techniques in Information Theoretic Multi-Party Computation, focusing on enduring methods that remain relevant and effective over time.
Michael Ben-Or's Contributions to Error Correction in Quantum Computing
Explore quantum error correction and its impact on quantum computing with insights from Michael Ben-Or's groundbreaking work in the field.
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.
Sublinear Time Algorithms for Estimating Edit Distance
Explore efficient methods for approximating edit distance between strings, focusing on sublinear time algorithms and their applications in computational biology and text processing.
Maximally Recoverable Codes for Distributed Storage Systems
Explore maximally recoverable codes for distributed storage systems, focusing on efficient repair, reliability, and storage optimization. Learn about different classes, bounds, and constructions.
High-Rate Fair-Density Parity-Check Codes
Introducing fair-density parity-check codes for high-rate applications, featuring a novel base matrix selection method, weight distribution analysis, and an efficient MP-PL decoding algorithm for improved performance.
Private Information Retrieval - Chasing Capacity with Algebraic Codes
Explore algebraic codes for private information retrieval, focusing on capacity-approaching techniques and their applications in secure data access.
Sparsity and Privacy in Distributed Matrix Multiplication
Explore advanced techniques for distributed matrix multiplication, focusing on sparsity and privacy considerations in large-scale computations.
Service Rates of MDS Codes and Fractional Matchings in Quasi-Uniform Hypergraphs
Explore distributed system performance metrics through service rate regions of MDS codes, connecting them to fractional matching polytopes in quasi-uniform hypergraphs for improved data storage and retrieval.
Combinatorial Problems in Support Recovery for 1-bit Compressed Sensing
Explore advanced techniques in 1-bit compressed sensing, focusing on combinatorial approaches to support recovery and their applications in coding theory.
Neural Distributed Source Coding
Explores a framework for lossy distributed source coding using conditional VQ-VAE, achieving state-of-the-art performance on complex correlations and high-dimensional data without relying on hand-crafted source modeling.
Coded Matrix Computation: Numerical Stability, Partial Stragglers, and Sparse Input Matrices
Explore advanced techniques for high-dimensional matrix computations in distributed systems, addressing numerical stability, partial stragglers, and sparse input matrices.
Polar Codes for IDS Channels
Explore polar codes for IDS channels, addressing numerical instability, partial stragglers, and worker computation time in sparse matrix scenarios. Learn recent contributions to overcome these challenges.
Quantized-Constraint Concatenation and the Covering Radius of Constrained Systems
Explores novel error-correction framework for constrained systems, introducing Quantized-Constraint Concatenation and analyzing covering radius to improve DNA storage coding techniques.
Generalized Staircase Codes With Arbitrary Bit Degree
Explores advanced error correction coding for high-performance data transmission, focusing on generalized staircase codes with flexible bit protection and reduced decoding complexity.