Minimum Distance of Column-Weight-4 LDPC Codes Derived from Array Codes

It has recently been recognized that column-weight-4 array codes give rise to a class of binary highrate low-density parity-check (LDPC) codes C(q, j = 4) with excellent performance on the AWGN channel. It is shown that the minimum Hamming distance of all these codes C(q, j = 4) of length N = q^2 is 10, provided that q is a prime greater or equal to 11. Furthermore, the corresponding codeword multiplicity is lower bounded by (q - 1)q^2.

By: Thomas Mittelholzer

Published in: RZ3556 in 2004


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .