In this work, we introduce a model of a single-failure locally recoverable
distributed storage system. This model appears to give rise to a problem seemingly dual of the well-studied index coding problem. Although the relation between the dimensions of an optimal index code and optimal distributed storage code of our model can be established based on previous works, we give a completely coding theoretic proof of this apparent duality result.