Multi-Version Coding
classification
💻 cs.DC
keywords
boundcodinglowermulti-versionproblemsimplealgorithmsalmost
read the original abstract
We derive a simple lower bound for the multi-version coding problem formulated in [1]. We also propose simple algorithms that almost match the lower bound derived. Another lower bound is proven for an extended version of the multi-version coding problem introduced in [2].
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.