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 International Symposium on Information Theory (ISIT)

An algebraic method for constructing efficiently encodable irregular LDPC codes

Hachiro Fujita, Maki Ohata, K. Sakaniwa

Published Jan 1, 2005• 4 citations
Publisher

Abstract

In this paper we propose an algebraic construction of efficiently encodable irregular LDPC codes. The proposed irregular LDPC codes have not only an efficient encoding algorithm but also guaranteed minimum distances. Simulation results show that the proposed codes perform well compared to randomly constructed irregular LDPC codes
DOI
10.1109/isit.2005.1523458

Related papers

Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking

Jun Xu, Lei Chen, Ivana Djurdjevic +2 more

Two algebraic methods for systematic construction of structured regular and irregular low-density parity-check (LDPC) codes with girth of at least six and good minimum distances are presented. These two methods are based on geometry decomposition and a masking technique. Numerical results show that the codes constructed by these methods perform close to the Shannon limit and as well as random-like LDPC codes. Furthermore, they have low error floors and their iterative decoding converges very fast. The masking technique greatly simplifies the random-like construction of irregular LDPC codes designed on the basis of the degree distributions of their code graphs

IEEE Transactions on Information Theory•Jan 1, 2007•161 citations

Two Algebraic Methods for Constructing Efficiently Encodable Quasi-Cyclic LDPC Codes

Keke Liu, Zesong Fei, Jingming Kuang

In this paper, we present two algebraic methods for constructing Quasi-Cyclic LDPC codes. The first method is based on the quadratic residues modulo p (where p is a prime), the second method is based on the multiplicative inverses in finite fields. The codes constructed based on these methods are efficiently encodable and have a girth at least 6. Simulation results show that with SPA decoding, the constructed codes based on our methods perform very well over the AWGN channel compared to some other types of famous codes, such as random Mackay code or extended EG-LDPC code recommended by NASA.

International Conference on Wireless Communications, Networking and Mobile Computing•Oct 1, 2008•0 citations

A simple algorithm to design irregular LDPC codes for finite length

Mehrdad Taki, Mahdi Orooji

A simple and practical algorithm to design an irregular low density parity check (LDPC) codes for finite length applications is introduced. The simulation result will be proved the advantages of designed codes in compare with conventional regular and irregular finite length LDPC codes. Due to the semi-random structure of proposed codes, it will be encoded simpler than the other LDPC codes. Finally, a modified extended bit filling (EBF) is proposed to control rows weight

IEEE International Conference on Communication Systems (ICCS)•Jan 1, 2006•1 citation

Good encodable irregular quasi-cyclic LDPC codes

Yang Xiao, Kiseon Kim

The existing encodable irregular LDPC codes may have a degraded BER performance when it is derived from classical regular QC LDPC codes since both girth property and weight property are not carefully given attention to two or more thing, which lead to some codes with large girths have small minimum weights and poor BER performance. To solve the problem, we propose a new approach to construct the encodable irregular QC codes, which can not produce new short girths and can keep the large minimum weight and minimum distance of the codes. The theorems of girth 4 and girth 6 are provided to test the girth variance of the obtained irregular QC codes. Simulations verify the construction of the QC LDPC codes to be valid, since better BER performance than that of existing encodable irregular LDPC codes is obtained.

IEEE International Conference on Communication Systems (ICCS)•Nov 1, 2008•6 citations

An Algebraic Method for Constructing Efficiently Encodable Irregular LDPC Codes

好一 坂庭, KOHICHI SAKANIWA

•Sep 1, 2005•0 citations

Construction of LDPC Codes Based on Narrow-Sense-Primitive BCH Codes

Yi Yu, Liu Shaobo, Huang Dawei

In this paper, we present an algebraic method for constructing regular low-density parity-check (LDPC) codes based on narrow-sense-primitive BCH codes. The construction method results in a class of high rate LDPC codes in Gallager's original form. Codes in this class are free of cycles of length 4 in their Tanner graph and have good minimum distances. They can perform well with the iterative decoding. Also, proposed algebra LDPC codes can be designed for a new class of irregular codes based on a semi-algebraic structure for various code rates. It is shown that, with the proposed construction algorithms, fast construction time and reduced memory without the performance degradation can be achieved.

IEEE Vehicular Technology Conference•Dec 10, 2005•5 citations
Two algebraic methods for systematic construction of structured regular and irregular low-density parity-check (LDPC) codes with girth of at least six and good minimum distances are presented. These two methods are based on geometry decomposition and a masking technique. Numerical results show that the codes constructed by these methods perform close to the Shannon limit and as well as random-like LDPC codes. Furthermore, they have low error floors and their iterative decoding converges very fast. The masking technique greatly simplifies the random-like construction of irregular LDPC codes designed on the basis of the degree distributions of their code graphs
In this paper, we present two algebraic methods for constructing Quasi-Cyclic LDPC codes. The first method is based on the quadratic residues modulo p (where p is a prime), the second method is based on the multiplicative inverses in finite fields. The codes constructed based on these methods are efficiently encodable and have a girth at least 6. Simulation results show that with SPA decoding, the constructed codes based on our methods perform very well over the AWGN channel compared to some other types of famous codes, such as random Mackay code or extended EG-LDPC code recommended by NASA.
The existing encodable irregular LDPC codes may have a degraded BER performance when it is derived from classical regular QC LDPC codes since both girth property and weight property are not carefully given attention to two or more thing, which lead to some codes with large girths have small minimum weights and poor BER performance. To solve the problem, we propose a new approach to construct the encodable irregular QC codes, which can not produce new short girths and can keep the large minimum weight and minimum distance of the codes. The theorems of girth 4 and girth 6 are provided to test the girth variance of the obtained irregular QC codes. Simulations verify the construction of the QC LDPC codes to be valid, since better BER performance than that of existing encodable irregular LDPC codes is obtained.
In this paper, we present an algebraic method for constructing regular low-density parity-check (LDPC) codes based on narrow-sense-primitive BCH codes. The construction method results in a class of high rate LDPC codes in Gallager's original form. Codes in this class are free of cycles of length 4 in their Tanner graph and have good minimum distances. They can perform well with the iterative decoding. Also, proposed algebra LDPC codes can be designed for a new class of irregular codes based on a semi-algebraic structure for various code rates. It is shown that, with the proposed construction algorithms, fast construction time and reduced memory without the performance degradation can be achieved.