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

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

Olgica Milenković, Kiran Prakash, Bane V. Vasic

Published Oct 1, 2003• 0 citations
OpenAlex

Related papers

Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding

Bane V. Vasic, Olgica Milenković

This paper introduces several new combinatorial constructions of low-density parity-check (LDPC) codes, in contrast to the prevalent practice of using long, random-like codes. The proposed codes are well structured, and unlike random codes can lend themselves to a very low-complexity implementation. Constructions of regular Gallager codes based on cyclic difference families, cycle-invariant difference sets, and affine 1-configurations are introduced. Several constructions of difference families used for code design are presented, as well as bounds on the minimal distance of the codes based on the concept of a generalized Pasch configuration.

IEEE Transactions on Information Theory•Jun 1, 2004•263 citations

Majority-based and hybrid iterative decoding of low-density parity-check codes

Pirouz Zarrinkhat

•Jan 1, 2005•0 citations

Time-invariant and switch-type hybrid iterative decoding of low-density parity-check codes

Pirouz Zarrinkhat, Amir H. Banihashemi, Hua Xiao

Annals of Telecommunications•Feb 1, 2005•10 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

Low-density parity-check code based on binary sequence splitting

Zhu Li-yan

A new and simple approach to construct irregular low-density parity-check(LDPC)code based on the binary sequence splitting was proposed.Experimental results show that constructed irregular LDPC code with iterative decoding perform well over the AWGN channel and have a good code weight distribution with 4-cycle free.

Journal of Shandong University of Technology•Jan 1, 2007•0 citations

Regular Low-Density Parity-Check codes based on shifted identity matrices

Shanbao He, Chunming Zhao, Ming Jiang

Journal of Electronics (China)•Jan 1, 2006•0 citations
This paper introduces several new combinatorial constructions of low-density parity-check (LDPC) codes, in contrast to the prevalent practice of using long, random-like codes. The proposed codes are well structured, and unlike random codes can lend themselves to a very low-complexity implementation. Constructions of regular Gallager codes based on cyclic difference families, cycle-invariant difference sets, and affine 1-configurations are introduced. Several constructions of difference families used for code design are presented, as well as bounds on the minimal distance of the codes based on the concept of a generalized Pasch configuration.
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).