Maximally Recoverable Codes

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


Duration: 37:18
463 views
0

Lalitha Vadlamani (International Institute of Information Technology, Hyderabad)
https://simons.berkeley.edu/talks/lalitha-vadlamani-international-institute-information-technology-hyderabad-2024-03-08
Application-Driven Coding Theory

In a distributed storage system, due to increase of storage capacity of a node, efficient repair of failed nodes has become increasingly important in addition to ensuring a given level of reliability and low storage overhead. Locally repairable codes are a class of codes designed for storage systems which have the characteristic that they trade off repair locality (number of nodes accessed to repair a failed node) for storage overhead. Maximally recoverable codes are a class of codes which correct maximum possible number of erasure patterns, given the locality constraints of the code and hence of interest. Three classes of maximally recoverable codes (MRC) based on the topology of the local parities will be introduced (i) MRC with locality (iii) MRC with hierarchical locality and (iii) Maximally Recoverable Tensor codes. Bounds, constructions and open problems related to these classes of MRCs will be discussed.



Other Videos By Simons Institute for the Theory of Computing


2024-04-04Sparsity and Privacy in Distributed Matrix Multiplication
2024-04-04Service Rates Of Mds Codes & Fractional Matchings In Quasi-Uniform Hypergraphs
2024-04-04Combinatorial Problems in Support Recovery for 1-bit Compressed Sensing
2024-04-04Approximate coding computing
2024-04-04Coded matrix computation: numerical stability, partial stragglers and sparse input matrices
2024-04-04Coding For Dna Storage With Nanopore Sequencing
2024-04-04Polar Codes For Ids Channels
2024-04-04Neural Distributed Source Coding
2024-04-04Quantized-Constraint Concatenation And The Covering Radius Of Constrained Systems
2024-04-04Cover Your Bases: How To Minimize The Sequencing Coverage In Dna Storage Systems
2024-04-04Maximally Recoverable Codes
2024-04-04Generalized Staircase Codes With Arbitrary Bit Degree
2024-04-04Low-Density Parity-Check Codes And Spatial Coupling For Quantitative Group Testing
2024-04-04Non-binary LDPC codes for Information Reconciliation in QKD Protocols
2024-04-04Dynamic Denoising For Amp Applied To Sparse Regression Inner Codes With Outer Codes
2024-04-04Interleaved Codes For Cryptography
2024-04-04Mackay-Neal Codes For High-Speed Wireless And Free-Space Optical Links
2024-04-04Algebraic Coding Problems From Quantum Fault-Tolerance
2024-04-04Binary CSS-T codes: characterizations and posets
2024-04-04Toward Efficient Genomic Compression Using Channel Codes For Joint Alignment And Reconstruction
2024-04-04Towards Practical Polar Codes With Low Scaling Exponent


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Application-Driven Coding Theory
Lalitha Vadlamani