Majority logic decoding

In error detection and correction, majority logic decoding is a method to decode repetition codes, based on the assumption that the largest number of… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We study a class of finite geometry codes referred to as finite hyperplane codes, which are constructed based on hyperplanes and… (More)
Is this relevant?
2017
2017
A majority logic decoder made of unreliable logic gates, whose failures are transient and data-dependent, is analyzed. Based on a… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2014
2014
A low-density parity-check (LDPC) code is a linear error correcting code, and is used for transmitting message over a noisy… (More)
Is this relevant?
2014
2014
Low density parity check codes are used to detect whether a word has errors in the first iterations of majority logic decoding… (More)
  • figure 1
  • table 2
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2013
Highly Cited
2013
In this Paper, we focus on a class of LDPC codes known as Euclidean Geometric (EG) LDPC codes, which are constructed… (More)
  • table 1
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
2011
2011
A modified reliability-based iterative majority-logic decoding (MRBI-MLGD) algorithm for two classes of structured LDPC codes is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
2009
2009
This paper presents two novel reliability-based iterative majority-logic decoding algorithms for LDPC codes. Both algorithms are… (More)
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1994
1994
 Consider C as an (n, k) cyclic code with parity check matrix H. H is an (n, n-k) which generate the dual code ,denoted by C d… (More)
Is this relevant?
1993
1993
One-step majority-logic decoding is one of the simplest algorithms for decoding cyclic block codes. However, it is an effective… (More)
  • figure 1
  • figure 3
  • table I
  • figure 5
Is this relevant?
1973
1973
A new class of cyclic multiple-error-correcting arithmetic codes is described, and the minimum distance of these codes is… (More)
Is this relevant?