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
본 논문은 분산 저장 시스템을 위한 패킷 중심의 삭제 정정 코드와 그 체계적 형태를 구성한다. 제안된 코드는 배타적 OR 및 비트 레벨 시프트 연산을 통해 인코딩됩니다. 시프트 작업으로 인해 인코딩된 패킷은 소스 패킷보다 약간 길어집니다. 본 논문에서는 오버헤드라고 불리는 인코딩된 패킷의 추가 길이를 평가하고 제안된 코드가 비트 레벨 시프트 연산과 배타적 OR을 사용하는 기존 코드인 지그재그 디코딩 가능 코드보다 작은 오버헤드를 가짐을 보여줍니다.
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.
부
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
부
@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},}
부
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 -