Non-binary LDPC codes for Data Storage
For data storage systems, this work provides theoretical bounds and construction methods for non-binary LDPC codes, offering a potential alternative to MDS codes like Reed-Solomon.
This paper analyzes non-binary LDPC codes for data storage, introducing the concept of ultimate distance to bound their minimum distance and deriving random-coding bounds on erasure correction performance. Examples of codes achieving the ultimate distance are constructed.
In modern data storage systems, non-binary LDPC codes for recovering from disk failures are increasingly considered strong competitors to MDS codes such as Reed-Solomon codes. Since disk failures can be modeled as erasures, we analyze non-binary LDPC codes over a $q$-ary field in the $q$-ary erasure channel, relative to MDS codes. Our focus is on non-binary LDPC codes whose parity-check matrix is obtained by replacing the non-zero entries of a binary base matrix by elements of a $q$-ary finite field. For such LDPC codes, we introduce the notion of ultimate distance, which upper-bounds their minimum distance. We derive a random-coding bound on the number of non-correctable erasure patterns for the Gallager ensemble of regular non-binary LDPC codes under maximum-likelihood decoding. An algorithm for finding the ultimate distance is presented. A low-complexity algorithm for searching for the minimum distance of the non-binary LDPC code is proposed. Finally, we construct examples of non-binary LDPC codes achieving the ultimate distance.