Аннотация:This paper is concerned with the properties of local reconstruction codes (LRC) both hierarchical and nonuniform, providing the reliability of data storages. The LRCs belong to erasure codes, which recover initial data from corruption at the cost of storage overhead due to introduced redundancy. The study is carried out via Markov chain solutions to reveal advantages and drawbacks of the LRCs in comparison with classical Reed–Solomon (RS) codes. Thus, we investigate dependencies of storage reliability on mean time of disk replacement for the codes under consideration.