Construct Double-Erasure-Correcting Data Layout Using P1F
Jing Liu · Dianzi xuebao · 2006
We present a virtual node simple graph representation for full-2 code(corresponds to complete graph),this representation simplifies the double-erasure-correcting data layout judgment theorem,the optimal redundancy data layout theorem and the construction of B-CODE.We also present a data layout construction method based on P1F of complete bipartite graph(corresponds to 2d parity code),this method can produce highly extensible double-erasure-correcting data layouts (BG-HEDP).Compared with other data layouts,such as B-CODE,BG-HEDP also has optimal update penalty,high reliability and low encoding/decoding complexity,its redundancy is very close to optimal value,while it is superior in extensibility to others.