Construction of Steiner Systems and High-Rate Low-Density Parity-Check Codes

Starting from a finite projective plane, a simple construction of low-density parity check (LDPC) matrices is presented. The factor graphs associated with these LDPC matrices have no 4-cycles due to the incident structure of lines and points in the projective plane. Furthermore, two constructions are proposed to combine suitably sized smaller LDPC matrices into a larger LDPC matrix. These constructions can be used to obtain infinite sequences of Steiner systems of any block size, which are
2-designs.

Index terms: Finite geometries, Steiner systems, low-density parity-check (LDPC) codes

By: T. Mittelholzer

Published in: RZ3299 in 2000

LIMITED DISTRIBUTION NOTICE:

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.

rz3299.pdf

Questions about this service can be mailed to reports@us.ibm.com .