The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Cet article construit des codes de correction d'effacement orientés paquets et leurs formes systématiques pour les systèmes de stockage distribués. Les codes proposés sont codés par opération OU exclusif et décalage de niveau bit. Grâce à l'opération de décalage, les paquets codés sont légèrement plus longs que les paquets source. Cet article évalue la longueur supplémentaire des paquets codés, appelée surcharge, et montre que les codes proposés ont des surcharges inférieures à celles des codes décodables en zigzag, qui sont des codes existants utilisant une opération de décalage au niveau des bits et un OU exclusif.
Yuta HANAKI
Yamaguchi University
Takayuki NOZAKI
Yamaguchi University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Yuta HANAKI, Takayuki NOZAKI, "Packet-Oriented Erasure Correcting Codes by Bit-Level Shift Operation and Exclusive OR" in IEICE TRANSACTIONS on Fundamentals,
vol. E102-A, no. 12, pp. 1622-1630, December 2019, doi: 10.1587/transfun.E102.A.1622.
Abstract: This paper constructs packet-oriented erasure correcting codes and their systematic forms for the distributed storage systems. 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 the encoded packets, called overhead, and shows that the proposed codes have smaller overheads than the zigzag decodable codes, which are existing codes using bit-level shift operation and exclusive OR.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E102.A.1622/_p
Copier
@ARTICLE{e102-a_12_1622,
author={Yuta HANAKI, Takayuki NOZAKI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Packet-Oriented Erasure Correcting Codes by Bit-Level Shift Operation and Exclusive OR},
year={2019},
volume={E102-A},
number={12},
pages={1622-1630},
abstract={This paper constructs packet-oriented erasure correcting codes and their systematic forms for the distributed storage systems. 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 the encoded packets, called overhead, and shows that the proposed codes have smaller overheads than the zigzag decodable codes, which are existing codes using bit-level shift operation and exclusive OR.},
keywords={},
doi={10.1587/transfun.E102.A.1622},
ISSN={1745-1337},
month={December},}
Copier
TY - JOUR
TI - Packet-Oriented Erasure Correcting Codes by Bit-Level Shift Operation and Exclusive OR
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1622
EP - 1630
AU - Yuta HANAKI
AU - Takayuki NOZAKI
PY - 2019
DO - 10.1587/transfun.E102.A.1622
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E102-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2019
AB - This paper constructs packet-oriented erasure correcting codes and their systematic forms for the distributed storage systems. 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 the encoded packets, called overhead, and shows that the proposed codes have smaller overheads than the zigzag decodable codes, which are existing codes using bit-level shift operation and exclusive OR.
ER -