Erasure Correcting Codes by Using Shift Operation and Exclusive OR
Yuta Hanaki, Takayuki Nozaki
TL;DR
This paper introduces a new erasure correcting code for distributed storage that uses exclusive OR and shift operations, achieving lower overhead than existing zigzag decodable codes.
Contribution
It presents a systematic erasure correcting code utilizing shift and XOR operations with reduced overhead compared to prior codes.
Findings
Proposed codes have smaller overhead than zigzag decodable codes.
Encoded packets are slightly longer due to shift operations.
The code is suitable for distributed storage systems.
Abstract
This paper proposes an erasure correcting code and its systematic form for the distributed storage system. The proposed codes are encoded by exclusive OR and bit-level shift operation. By the shift operation, the encoded packets are slightly longer than the source packets. This paper evaluates the extra length of encoded packets, called overhead, and shows that the proposed codes have smaller overheads than the zigzag decodable code, which is an existing code using exclusive OR and bit-level shift operation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.