Asymptotically MDS Array BP-XOR Codes
2018 IEEE International Symposium on Information Theory, ISIT 2018, Colorado, Amerika Birleşik Devletleri, 17 - 22 Haziran 2018, cilt.2018-June, ss.1316-1320, (Tam Metin Bildiri)
- Yayın Türü: Bildiri / Tam Metin Bildiri
- Cilt numarası: 2018-June
- Doi Numarası: 10.1109/isit.2018.8437759
- Basıldığı Şehir: Colorado
- Basıldığı Ülke: Amerika Birleşik Devletleri
- Sayfa Sayıları: ss.1316-1320
- Açık Arşiv Koleksiyonu: AVESİS Açık Erişim Koleksiyonu
- Boğaziçi Üniversitesi Adresli: Hayır
Özet
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 blocklength, 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-X OR 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. A full version of this paper is accessible at: https://arxiv.org/abs/1709.07949