Codes and information

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=czb6JqRQb40


Duration: 57:53
313 views
6

Towards local testability for quantum coding
Anthony Leverrier (Inria), Vivien Londe (Inria, Institut de Mathématiques de Bordeaux, Microsoft), Gilles Zémor (Institut de Mathématiques de Bordeaux)

Sharp Threshold Rates for Random Codes
Venkatesan Guruswami (CMU), Jonathan Mosheiff (CMU), Nicolas Resch (CWI), Shashwat Silas (Stanford), Mary Wootters (Stanford)

High-entropy dual functions and locally decodable codes
Farrokh Labib (CWI), Jop Briet (CWI)

Error Correcting Codes for Uncompressed Messages
Ofer Grossman (MIT), Justin Holmgren (NTT Research)

The entropy of lies: playing twenty questions with a liar
Yuval Dagan (MIT), Yuval Filmus (Technion), Daniel Kane (UCSD), Shay Moran (Technion)

ITCS 2021



Other Videos By Simons Institute for the Theory of Computing


2021-01-15The Complexity of Finding Fair Independent Sets in Cycles
2021-01-15Algorithmic Persuasion with Evidence
2021-01-15Comparing computational entropies below majority (or: When is the dense model theorem false?)
2021-01-15The entropy of lies: playing twenty questions with a liar
2021-01-12Error Correcting Codes for Uncompressed Messages
2021-01-12Algorithms and Hardness for Multidimensional Range Updates and Queries
2021-01-12Algebraic and circuit complexity
2021-01-12Online and streaming algorithms
2021-01-12Algorithmic Game Theory
2021-01-12Optimization
2021-01-12Codes and information
2021-01-12Machine Learning
2021-01-11Circuits and communication
2021-01-10Graph algorithms
2021-01-10Algorithms
2021-01-10GRADUATING BITS
2021-01-10Algorithmic game theory
2021-01-10Quantum information
2021-01-10Quantum
2021-01-09Analytic methods
2021-01-09Computational complexity


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
ITCS 2021