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

An Algebraic Method for Constructing Efficiently Encodable Irregular LDPC Codes

好一 坂庭, KOHICHI SAKANIWA

Published Sep 1, 2005• 0 citations
OpenAlex

Related papers

An algebraic method for constructing efficiently encodable irregular LDPC codes

Hachiro Fujita, Maki Ohata, K. Sakaniwa

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

IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2005•4 citations

Algebraic Constructions of High Performance and Efficiently Encodable Non-Binary Quasi-Cyclic LDPC Codes

Bo Zhou

•Jan 1, 2008•2 citations

Effective Methods of Constructing Irregular LDPC Codes under Message-Passing Decoding and Updating Order for Sequential Decoding

Yuki Taniguchi, Gou Hosoya, Masayuki Goto +1 more

IEICE Technical Report; IEICE Tech. Rep.•Jul 16, 2009•0 citations

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•33 citations

On the Construction and Decoding of Cyclic LDPC Codes

Chao Chen

•Jan 1, 2014•0 citations

A systematic construction of irregular low-density parity-check codes from combinatorial designs

S. Sankaranarayanan, Bane V. Vasic, Erozan M. Kurtas

In this paper, we propose an algorithm to design an irregular low-density parity-check (LDPC) code, with a given degree distribution pair, from a combinatorially constructed regular LDPC code. Richardson et al., (2001) showed that long LDPC codes from irregular bipartite graphs with carefully chosen degree distribution pair performed very close to the Shannon capacity limit. It is known that the cyclic or quasicyclic property of regular LDPC codes, constructed from combinatorial designs Colbourn, J et al., (1996), helps to simplify their encoding procedure and also facilitates a memory-efficient storage of the codes. The proposed algorithm involves splitting columns and rows of a regular LDPC code systematically in order to achieve an irregular code with a given distribution pair. Also, this algorithm is a useful alternative to random generation of irregular codes because it enables to exploit the structural properties of the regular code in efficiently storing the resultant irregular code.

IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2003•5 citations
In this paper, we propose an algorithm to design an irregular low-density parity-check (LDPC) code, with a given degree distribution pair, from a combinatorially constructed regular LDPC code. Richardson et al., (2001) showed that long LDPC codes from irregular bipartite graphs with carefully chosen degree distribution pair performed very close to the Shannon capacity limit. It is known that the cyclic or quasicyclic property of regular LDPC codes, constructed from combinatorial designs Colbourn, J et al., (1996), helps to simplify their encoding procedure and also facilitates a memory-efficient storage of the codes. The proposed algorithm involves splitting columns and rows of a regular LDPC code systematically in order to achieve an irregular code with a given distribution pair. Also, this algorithm is a useful alternative to random generation of irregular codes because it enables to exploit the structural properties of the regular code in efficiently storing the resultant irregular code.