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 Transactions on Information Theory

On decoding iterated codes

Sudhakar M. Reddy

Published Sep 1, 1970• 33 citations
Publisher

Abstract

Algorithms to decode iterated codes when at least one of the "component codes" is majority decodable are given. The decoding algorithms allow the use of the decoders of the component codes and still make it possible to correct all error patterns guaranteed to be correctable by the minimum distance of the iterated code.
DOI
10.1109/tit.1970.1054504

Related papers

Some new results on majority-logic codes for correction of random errors

D. McQuilton

The main advantages of random error-correcting majority-logic codes and majority-logic decoding in general are well known and two-fold. Firstly, they offer a partial solution to a classical coding theory problem, that of decoder complexity. Secondly, a majority-logic decoder inherently corrects many more random error patterns than the minimum distance of the code implies is possible. The solution to the decoder complexity is only a partial one because there are circumstances under which a majority-logic decoder is too complex and expensive to implement. [Continues.]

•Jan 1, 1978•2 citations

L-STEP MAJORITY LOGIC DECODING,

Robert Tien-Wen Chien, Spencer W. Ng

In the search for multiple-error-correcting codes which can be easily and rapidly decoded, some coding theorists have turned their attentions to threshold (majority logic) decoding. Much work has been done in this area recently, and quite a few classes of new codes suitable for threshold decoding have been developed. The main desirable feature of majority logic decoding is that it can be very simply implemented. Furthermore majority decoding can also automatically correct many more patterns of errors other than those guaranteed by the decoding schemes without any additional equipment. This paper is a survey of the L-step majority decoding.

•Jun 1, 1970•0 citations

Multithreshold majority decoding of LDPC-codes

Павел Павлович Урбанович, Романенко Дмитрий Михайлович, D. Shiman +1 more

The article deals with the majority decoding LDPC-codes - three-dimensional linear iterative codes. The possibility of correcting different types of multiple errors is analyzed. The expediency of using multithreshold majority decoding with codes, belonging to this class is presented.

Informatyka Automatyka Pomiary w Gospodarce i Ochronie Środowiska•Jan 1, 2012•1 citation

Iterative majority logic decoding of a class of Euclidean Geometry codes

Andrew Thangaraj, S.W. McLaughlin

Hard decision decoding of low density parity check (LDPC) codes has potential applications in practical settings like data storage. For this purpose, it is important for the code to have an assured minimum distance and, hence, guaranteed error correction capability. In this paper, we show that with very high probability the guaranteed error correction capability of Euclidean geometry (EG) codes using threshold-optimized, iterative majority logic (ML) decoding is much greater than the usual single iteration ML decoding, making these codes much more attractive for hard decision decoding. For instance, the (262143, 242461, t/spl ges/256) EG code (a (512, 512)-regular LDPC code) can correct t=580 bit errors with probability better than 1-1/spl times/10/sup -58/.

IEEE International Symposium on Information Theory (ISIT)•Jun 25, 2003•1 citation

On the convergence of the iterated decoding algorithm

Giuseppe Caire, Giorgio Taricco, E. Biglieri

The concept of iterated decoding of concatenated codes has been developed. Successful applications of this concept include turbo-codes and soft-decoding of product codes. After stating the iterated decoding algorithm formally, we provide a conjecture on the convergence and the asymptotic optimality of this algorithm.

IEEE International Symposium on Information Theory (ISIT)•Nov 19, 2002•6 citations

Decoding Algorithms for Majority-Logic Decodable LDPC Codes

Chen Haiqian

Dianzi xuebao•Jan 1, 2015•0 citations
The main advantages of random error-correcting majority-logic codes and majority-logic decoding in general are well known and two-fold. Firstly, they offer a partial solution to a classical coding theory problem, that of decoder complexity. Secondly, a majority-logic decoder inherently corrects many more random error patterns than the minimum distance of the code implies is possible. The solution to the decoder complexity is only a partial one because there are circumstances under which a majority-logic decoder is too complex and expensive to implement. [Continues.]
In the search for multiple-error-correcting codes which can be easily and rapidly decoded, some coding theorists have turned their attentions to threshold (majority logic) decoding. Much work has been done in this area recently, and quite a few classes of new codes suitable for threshold decoding have been developed. The main desirable feature of majority logic decoding is that it can be very simply implemented. Furthermore majority decoding can also automatically correct many more patterns of errors other than those guaranteed by the decoding schemes without any additional equipment. This paper is a survey of the L-step majority decoding.
Hard decision decoding of low density parity check (LDPC) codes has potential applications in practical settings like data storage. For this purpose, it is important for the code to have an assured minimum distance and, hence, guaranteed error correction capability. In this paper, we show that with very high probability the guaranteed error correction capability of Euclidean geometry (EG) codes using threshold-optimized, iterative majority logic (ML) decoding is much greater than the usual single iteration ML decoding, making these codes much more attractive for hard decision decoding. For instance, the (262143, 242461, t/spl ges/256) EG code (a (512, 512)-regular LDPC code) can correct t=580 bit errors with probability better than 1-1/spl times/10/sup -58/.