Asymptotically Mds Array Bp-Xor Codes
Loading...
Date
2018
Authors
Arslan, Şuayb Şefik
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Belief propagation (BP) on binary erasure channels (BEC) is a low complexity decoding algorithm that allows the recovery of message symbols based on bipartite graph pruning process. Recently, array XOR codes have attracted attention for storage systems due to their burst error recovery performance and easy arithmetic based on Exclusive OR (XOR)-only logic operations. Array BP-XOR codes are a subclass of array XOR codes that can be decoded using BP under BEC. Requiring the capability of BP-decodability in addition to Maximum Distance Separability (MDS) constraint on the code construction process is observed to put an upper bound on the achievable code block-length, which leads to the code construction process to become a hard problem. In this study, we introduce asymptotically MDS array BP-XOR codes that are alternative to exact MDS array BP-XOR codes to allow for easier code constructions while keeping the decoding complexity low with an asymptotically vanishing coding overhead. We finally provide a code construction method that is based on discrete geometry to fulfill the requirements of the class of asymptotically MDS array BP-XOR codes.
Description
Şefik Şuayb Arslan (MEF Author)
Keywords
Transforms ??? key plus
Turkish CoHE Thesis Center URL
Citation
Arslan, S.S. (2018) Asymptotically MDS Array BP-XOR Codes. Conference: IEEE International Symposium on Information Theory (ISIT) Location: Vail, CO. p.1316-1320.
WoS Q
N/A
Scopus Q
N/A
Source
Conference: IEEE International Symposium on Information Theory (ISIT) Location: Vail, CO Date: JUN 17-22, 2018
Volume
Issue
Start Page
1316
End Page
1320