Quasi-cyclic LDPC codes from difference families
conference contribution
posted on 2025-05-10, 12:45 authored by Sarah JohnsonSarah Johnson, Steven WellerSteven WellerWe consider in this paper regular and nearly regular quasi-cyclic low-density parity-check (LDPC) codes, derived from families of difference sets. The codes have girth at least 6, and sparse parity-check matrices. They are designed to perform well when iteratively decoded with the sum-product decoding algorithm and to allow low complexity encoding.
History
Source title
Proceedings: 3rd Australian Communications Theory Workshop, 2002Name of conference
3rd Australian Communications Theory Workshop, 2002 (AusCTW 2002)Location
CanberraStart date
2002-02-04End date
2002-02-05Pagination
18-22Editors
Kennedy, R. A. and Grant, A. J.Publisher
Australian National UniversityPlace published
CanberraLanguage
- en, English
College/Research Centre
Faculty of Engineering and Built EnvironmentSchool
School of Electrical Engineering and Computer ScienceUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC