David Cash, Dennis Hofheinz, et al.
Journal of Cryptology
The potential of using various classes of MDS array codes as LDPC codes is examined. These codes include the BR code, a modified EVENODD code, and the X-code. The algebraic structures of the array codes can enable more efficient encoding and decoding in terms of memory space and computation time. Experimental results show iterative decoding of these array codes provides comparable or slightly better error correction performance than a regular LDPC code with similar parameters. In addition, these codes can be decoded as array codes.
David Cash, Dennis Hofheinz, et al.
Journal of Cryptology
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences