Resolvable 2-designs for regular low-density parity-check codes
journal contribution
posted on 2025-05-11, 09:58 authored by Sarah JohnsonSarah Johnson, Steven WellerSteven WellerThis paper extends the class of low-density parity-check (LDPC) codes that can be algebraically constructed. We present regular LDPC codes based on resolvable Steiner 2-designs which have Tanner graphs free of four-cycles. The resulting codes are (3, ρ)-regular or (4, ρ)-regular for any value of ρ and for a flexible choice of code lengths.
History
Related Materials
- 1.
- 2.
Journal title
IEEE Transactions on CommunicationsVolume
51Issue
9Pagination
1413-1419Publisher
Institute of Electrical and Electronics Engineers (IEEE)Language
- en, English
College/Research Centre
Faculty of Engineering and Built EnvironmentSchool
School of Electrical Engineering and Computer ScienceRights statement
Copyright © 2003 IEEE. Reprinted from IEEE Transactions on Communications, Vol. 51, Issue 9, p. 1413-1419. 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.Usage metrics
Categories
Keywords
Licence
Exports
RefWorksRefWorks
BibTeXBibTeX
Ref. managerRef. manager
EndnoteEndnote
DataCiteDataCite
NLMNLM
DCDC

