Jump to content

Binary Reed–Solomon encoding

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Hhhuge (talk | contribs) at 05:11, 19 February 2016 (Created page with ' BRS(Binary Reed-Solomon) Coding, which belongs to a RS codes, is a way of encoding that can fix node data loss in a distributed storage environment, It has MDS...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

BRS(Binary Reed-Solomon) Coding, which belongs to a RS codes, is a way of encoding that can fix node data loss in a distributed storage environment, It has MDS’s(Maximum Distance Separable) encoding properties,Its encoding and decoding rate outperforms conventional RS coding and optimum CRS coding.

Background RS Coding is a fault-tolerant encoding method in a distributed storage environment, It stores data into k blocks, each block is size L, and generating n coded blocks in k data blocks via coding matrix, where n=k+m. Each coded block is stored in a storage node, when the loss number of encoded blocks is not greater than m, the system can fix all the data from any of the k coded blocks.