Signal, if you can’t (for the damage)

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


Duration: 46:46
39 views
2

Ran Gelles (Bar-Ilan University)
https://simons.berkeley.edu/talks/ran-gelles-bar-ilan-university-2024-04-09
Advances in the Theory of Error-Correcting Codes

Error-correction codes add redundancy so that information can be delivered even if parts of the transmission are corrupted. However, when noise can corrupt all the transmissions, such codes become useless and new methods must be developed to transmit information between parties. In this talk, we present signaling methods for performing arbitrary computations in asynchronous networks where all messages in all links are subject to corruption, i.e., their contents are completely damaged.



Other Videos By Simons Institute for the Theory of Computing


2024-04-24Tree codes
2024-04-24An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes
2024-04-24Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes
2024-04-24Asymptotically-Good RLCCs with (log n)^{2+o(1)} Queries
2024-04-24Relaxed Local Correctability from Local Testing
2024-04-24Coding Theory in Almost Linear Time and Sublinear Space
2024-04-24Codes with the multiplication property
2024-04-24Dual of (evaluation) codes
2024-04-24Binary Codes with Resilience Beyond 1/4 via Interaction
2024-04-24Constant Query Local Decoding Against Deletions Is Impossible
2024-04-24Signal, if you can’t (for the damage)
2024-04-24What Can and What Cannot Be Done by LP and SDP (An Incomplete Overview)
2024-04-24The Hermitian Trace Code
2024-04-24Binary Error Correcting Codes with Minimal Noiseless Feedback
2024-04-24Gilbert and Varshamov meet Johnson: List Decoding Nearly-Optimal Binary Codes
2024-04-24List Decoding of Tanner and Expander Amplified Codes...
2024-04-22Fault tolerance with the ZX-calculus and fusion complexes: tools for QEC development in the...
2024-04-17Quantum Constraint Satisfaction | Richard M. Karp Distinguished Lecture
2024-04-16Some Stories of Graphs and Geometry
2024-04-16Locality in Codes and Computation | Richard M. Karp Distinguished Lecture
2024-04-15Communicating Algorithmic Science to the Public | Theoretically Speaking


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Advances in the Theory of Error-Correcting Codes
Ran Gelles