We consider irregular quasi-cyclic low-density parity-check (LDPC) codes derived from difference families. The resulting codes can be encoded with low complexity and perform well when iteratively decoded with the sum-product algorithm.
Journal title
IEEE Communications LettersVolume
7Issue
2Pagination
79-81Publisher
Institute of Electrical and Electronics Engineers (IEEE)College/Research Centre
Faculty of Engineering and Built EnvironmentSchool
School of Electrical Engineering and Computer ScienceRights statement
Copyright © 2003 IEEE. Reprinted from IEEE Communications Letters, Vol. 7, Issue 2, p. 79-81. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Newcastle's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
