  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].
