About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
IEEE International Symposium on Information Theory - Proceedings
Paper
Soft decoding of several classes of array codes
Abstract
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.