Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Communications Letters

A family of irregular LDPC codes with low encoding complexity

Sarah J. Johnson, Steven R. Weller

Published Feb 1, 2003• 110 citations
Publisher

Abstract

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.
DOI
10.1109/lcomm.2002.808375

Related papers

Quasi-cyclic LDPC codes from difference families

Sarah J. Johnson, Steven R. Weller

Abstract — We consider in this paper regular and nearly regular quasi-cyclic low-density parity-check (LDPC) codes, derived from families of dif-ference 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. I.

•Jan 1, 2002•16 citations

A new family of irregular LDPC Codes

Hong Wen, Fei Hu, Han Li +1 more

In this paper, we present a method for constructing irregular LDPC (low density parity check) codes based on the optical orthogonal codes. The resulting codes are quasi-cyclic codes and can be encoded with low complexity. They perform well with the sum-product iterative decoding.

IEEE Circuits and Systems Symposium on Emerging Technologies•Nov 13, 2004•1 citation

Construction of Irregular LDPC Codes by Quasi-Cyclic Extension

Jinghu Chen, R. Michael Tanner, Juntan Zhang +1 more

In this correspondence, we propose an approach to construct irregular low-density parity-check (LDPC) codes based on quasi-cyclic extension. When decoded iteratively, the constructed irregular LDPC codes exhibit a relatively low error floor in the high signal-to-noise ratio (SNR) region and are subject to relatively few undetected errors. The LDPC codes constructed based on the proposed scheme remain efficiently encodable

IEEE Transactions on Information Theory•Apr 1, 2007•35 citations

Class of irregular LDPC codes with low encoding complexity

WU Yu-ping

Journal of Jilin University•Jan 1, 2009•0 citations

A Family of Irregular LDPC Codes Based on Optical Orthogonal Codes

Wen Hong

Based on the optical orthogonal codes, a method for constructing irregular LDPC (low-density parity check) codes was presented. These LDPC codes are quasi-cyclic codes and can be encoded with low complexity with a linear relationship to code length. These codes have Tanner graphs free of 4-cycles. They perform well with the sum-product iterative decoding. Compared with random codes and regular LDPC codes based on the optical orthogonal codes with similar parameters, they have decoding performance gains respectively about 0.3 and 0.15 dB when bit error rate is 10~(-5).

Journal of Southwest Jiaotong University•Jan 1, 2004•0 citations

Regular and Irregular Low Density Parity Check Codes for Iterative Decoding based on Cycle-invariant Difference Sets

Olgica Milenković, Kiran Prakash, Bane V. Vasic

•Oct 1, 2003•0 citations
Based on the optical orthogonal codes, a method for constructing irregular LDPC (low-density parity check) codes was presented. These LDPC codes are quasi-cyclic codes and can be encoded with low complexity with a linear relationship to code length. These codes have Tanner graphs free of 4-cycles. They perform well with the sum-product iterative decoding. Compared with random codes and regular LDPC codes based on the optical orthogonal codes with similar parameters, they have decoding performance gains respectively about 0.3 and 0.15 dB when bit error rate is 10~(-5).