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

IU-Journal of Electrical & Electronics Engineering

ITERATIVE DECODING OF GEOMETRIC PRODUCT CODES

Gökmen Altay, Osman Nuri UCAN

Published Jan 1, 2005• 0 citations
OpenAlex

Abstract

We present iterative decoding process of Geometric Product codes that is a newly proposed linear block code construction technique. We also report the bit error performances for one of the constructed code of the technique utilising our iterative decoding approach.

Related papers

DECODING OF MATRIX-PRODUCT CODES

Fernando Hernando, Diego Ruano

We propose a decoding algorithm for the (u | u + v)-construction that decodes up to half of the minimum distance of the linear code. We extend this algorithm for a class of matrix-product codes in two different ways. In some cases, one can decode beyond the error-correction capability of the code.

arXiv:1107.1529•Journal of Algebra and Its Applications•Sep 1, 2012•26 citations

On General Linear Block Code Decoding Using the Sum–Product Iterative Decoder

Todd K. Moon

The sum-product iterative decoder, conventionally used for low-density parity-check (LDPC) codes, hold promise as a decoder for general linear block code decoding. However, the promise is only partly fulfilled because, as we show experimentally, the decoder performance degrades rapidly as a function of parity check matrix weight. Even in the case of decoder failure, however, we demonstrate that there is information present in the decoder output probabilities that can still help with the decoding problem.

IEEE Communications Letters•Jun 1, 2004•10 citations

A NEW APPROXIMATE ANALYTICAL METHOD FOR PERFORMANCE ANALYSIS OF REGULAR LDPC CODES ITERATIVE DECODING ON AWGN CHANNELS

Hossein Samimi, Paeiz Azmi, M Hakak

•Jan 1, 2007•0 citations

A new iterative decoder for product codes

K Kapustin Alexey, Iitp Ras, Zyablov Victor +2 more

The most popular decoder for product codes is an iterative decoder. It has low complexity and can correct many errors in average case, but it also has an uncorrectable errors of weight equal to one quoter code distance. To overcome this limitation we propose a new decoder algorithm, that utilizes iterative decoder, but has better error correction efficiency at low error rates. Thecomputer simulation showed that the increase in error correction efficiency is larger for high-rate codes.

•Jan 1, 2014•3 citations

SIMPLIFIED SUCCESSIVE-CANCELLATION LIST POLAR DECODING FOR BINARY LINEAR BLOCK CODES

Driss Khebbou, Reda Benkhouya, Idriss Chana +1 more

This paper aims to take advantage of the performances of polar decoding techniques for the benefit of binary linear block codes (BLBCs) with the main objective is to study the performances of the SSCL decoding for short-length BLBCs. Polar codes are one of the most recent error-correcting codes to be invented, and they have been mathematically demonstrated to be able to correct all errors under a specific situation, using the successive-cancellation decoder. However, their performances for real-time wireless communications at short block lengths remain less attractive. To take advantage of the performance of these codes in favor of error correction codes of short block length, an adaptation of the simplified successive-cancellation list as a decoder for polar codes for the benefit of short block length binary linear block codes is presented in this paper. This adaptation makes it possible to take advantage of the performances of less complex decoding methods for polar codes for BLBCs with latency and complexity optimization of the standard successive-cancellation list decoder. The experiment shows that the method can achieve the performances of the most famous order statistic decoder for binary linear block codes, which can achieve the performances of maximum-likelihood decoding with computational complexity and memory constraints.

Journal of Southwest Jiaotong University•Dec 24, 2021•3 citations

Simple Computation Method of Soft Value for Iterative Decoding for Product Code Composed of Linear Block Code (Special Section on Information Theory and Its Applications)

Toshiyuki Shohon, Yoshihiro Soutome, Haruo Ogiwara

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Oct 25, 1999•5 citations
The sum-product iterative decoder, conventionally used for low-density parity-check (LDPC) codes, hold promise as a decoder for general linear block code decoding. However, the promise is only partly fulfilled because, as we show experimentally, the decoder performance degrades rapidly as a function of parity check matrix weight. Even in the case of decoder failure, however, we demonstrate that there is information present in the decoder output probabilities that can still help with the decoding problem.
This paper aims to take advantage of the performances of polar decoding techniques for the benefit of binary linear block codes (BLBCs) with the main objective is to study the performances of the SSCL decoding for short-length BLBCs. Polar codes are one of the most recent error-correcting codes to be invented, and they have been mathematically demonstrated to be able to correct all errors under a specific situation, using the successive-cancellation decoder. However, their performances for real-time wireless communications at short block lengths remain less attractive. To take advantage of the performance of these codes in favor of error correction codes of short block length, an adaptation of the simplified successive-cancellation list as a decoder for polar codes for the benefit of short block length binary linear block codes is presented in this paper. This adaptation makes it possible to take advantage of the performances of less complex decoding methods for polar codes for BLBCs with latency and complexity optimization of the standard successive-cancellation list decoder. The experiment shows that the method can achieve the performances of the most famous order statistic decoder for binary linear block codes, which can achieve the performances of maximum-likelihood decoding with computational complexity and memory constraints.