A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
The cover metric is suitable for describing the resilience against correlated errors in arrays, in particular crisscross errors, which makes it interesting for applications such as distributed data storage (DDS). In this work, we consider codes designed for the cover metric that have locality, that means lost symbols can be recovered by using only a few other (local) symbols. We derive and prove a Singleton-like bound on the minimum cover distance of cover-metric codes with locality and proposearXiv:1806.07496v2 fatcat:a2s6icaf5bgvhbchrykm4r7sdi