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)

Graph theoretic construction of generalized product codes

Paul S. Guinand, J. Lodge

Published Nov 22, 2002• 20 citations
Publisher

Abstract

In this note we describe a construction, based on bipartite graphs of high girth, of codes which lend themselves to an iterative MAP decoding strategy.
DOI
10.1109/isit.1997.613026

Related papers

From concatenated codes to graph codes

JØrn Justesen, Tom Høholdt

We consider codes based on simple bipartite expander graphs. These codes may be seen as the first step leading from product type concatenated codes to more complex graph codes. We emphasize constructions of specific codes of realistic lengths, and study the details of decoding by message passing in trees.

Manufacturing Engineer•Apr 6, 2005•2 citations

Construction of Regular and Irregular LDPC Codes using (n, {k1, k2}, 1) Block Design

Siddarama R. Patil, Sant Saran Pathak

In this paper, we construct regular and irregular LDPC codes using (n, {k1,k2}, 1)block design. The problem of designing regular and irregular structured LDPC codes that have good overall error performance for wide range of code rates and block sizes with attractive storage requirements is attempted. The codes constructed by this method have the girth at least 6 and they perform well with the sum-product iterative decoding algorithm. Further we analyze the constructed codes based on number of short cycles of the corresponding Tanner graph. The analysis shows that codes having small number of short cycles and a cycle structure which is not overly regular in their Tanner graph perform better. The presented codes are well structured and unlike random codes can lend themselves to a very low-complexity encoder and decoder implementation.

International Conference on Signal Processing and Communications (SPCOM)•Jan 1, 2007•0 citations

Construction of multiple-rate quasi-cyclic LDPC codes with girth eight

Jialing Li, Wen Chen, Xueqin Jiang +2 more

This paper proposes a new approach to construct quasi-cyclic low-density parity-check (QC-LDPC) codes of girth 8. The proposed codes are based on a bipartite graph called Moore graph. By decomposing the bit nodes of the bipartite graph, the proposed QC-LDPC codes have variable code lengths and rates. Simulation results show that the proposed QC-LDPC codes have good performance with an iterative decoding over an AWGN channel.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2016•1 citation

On Iterative Decoding of Cycle Codes of Graphs

Gilles Zémor

The IMA volumes in mathematics and its applications•Jan 1, 2001•5 citations

Construction of codes based on finite generalized quadrangles for iterative decoding

Pascal O. Vontobel, R. Michael Tanner

Finite generalized polygons (FGPs) for constructing Tanner graphs are investigated, focusing on finite generalized quadrangles (FGQs). Graphs from FGPs are distinctive in that their girths are the largest possible, namely, exactly twice the diameter. Rates, minimum distances, and simulation results using enhanced sum-product decoders are given.

IEEE International Symposium on Information Theory (ISIT)•Nov 13, 2002•35 citations

Iterative decoding of codes defined on graphs

A. L. Reznik

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.

•Jan 1, 1998•7 citations
In this paper, we construct regular and irregular LDPC codes using (n, {k1,k2}, 1)block design. The problem of designing regular and irregular structured LDPC codes that have good overall error performance for wide range of code rates and block sizes with attractive storage requirements is attempted. The codes constructed by this method have the girth at least 6 and they perform well with the sum-product iterative decoding algorithm. Further we analyze the constructed codes based on number of short cycles of the corresponding Tanner graph. The analysis shows that codes having small number of short cycles and a cycle structure which is not overly regular in their Tanner graph perform better. The presented codes are well structured and unlike random codes can lend themselves to a very low-complexity encoder and decoder implementation.