Regularity characterization conjecture for correctable patterns in tensor-product topologies
Regularity characterization conjecture for correctable patterns in tensor-product topologies
Consider the topology and an erasure pattern . For all and , write and . The pattern is regular if
Regularity characterization conjecture. An erasure pattern is correctable for if and only if it is regular.
Regularity is known to be necessary for correctability, while the source states that sufficiency is proved in the setting where ; the general characterization remains open.
Sources & referencesView supporting material
Primary source
Parikshit Gopalan, Guangda Hu, Swastik Kopparty, Shubhangi Saraf, Carol Wang and Sergey Yekhanin, “Maximally Recoverable Codes for Grid-like Topologies”, arXiv:1605.05412 (2016).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.