Erasure Correcting Codes by Using Shift Operation and Exclusive OR

04/13/2018
by   Yuta Hanaki, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/16/2018

Efficient Scheduling of Serial Iterative Decoding for Zigzag Decodable Fountain Codes

Fountain codes are erasure correcting codes realizing reliable communica...
research
05/21/2018

On Universally Good Flower Codes

For a Distributed Storage System (DSS), the Fractional Repetition (FR) c...
research
04/13/2018

Non-binary Code Correcting Single b-Burst of Insertions or Deletions

This paper constructs a non-binary code correcting a single b-burst of i...
research
02/14/2019

ERSFQ 8-bit Parallel Binary Shifter for Energy-Efficient Superconducting CPU

We have designed and tested a parallel 8-bit ERSFQ binary shifter that i...
research
05/10/2022

All-to-All Encode in Synchronous Systems

We define all-to-all encode, a collective communication operation servin...
research
03/16/2018

Runlength-Limited Sequences and Shift-Correcting Codes

This work is motivated by the problem of error correction in bit-shift c...
research
08/26/2019

A Short Course on Error-Correcting Codes

When digital data are transmitted over a noisy channel, it is important ...

Please sign up or login with your details

Forgot password? Click here to reset