2007
DOI: 10.1109/tit.2006.889699
|View full text |Cite
|
Sign up to set email alerts
|

Soft-Decision Decoding Using Ordered Recodings on the Most Reliable Basis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
26
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 58 publications
(26 citation statements)
references
References 12 publications
0
26
0
Order By: Relevance
“…In the literature, several improvements to the original OSD algorithm have been presented that aim to reduce the complexity of the optimal decoder and offer a finer performancecomplexity trade-off [13]- [19]. In our implementation of the algorithm we used the probabilistic necessary condition from [17], the probabilistic sufficient condition [15], the reference re-encoding scheme [17], the preprocessing rules from [16], and the multiple biases diversity scheme from [18].…”
Section: B Improvementsmentioning
confidence: 99%
“…In the literature, several improvements to the original OSD algorithm have been presented that aim to reduce the complexity of the optimal decoder and offer a finer performancecomplexity trade-off [13]- [19]. In our implementation of the algorithm we used the probabilistic necessary condition from [17], the probabilistic sufficient condition [15], the reference re-encoding scheme [17], the preprocessing rules from [16], and the multiple biases diversity scheme from [18].…”
Section: B Improvementsmentioning
confidence: 99%
“…Therefore, we can consider the performance achieved by Eve through iterative decoding as a reliable estimate of the optimal decoder performance. This also avoids the need to consider that Eve uses other decoders, like, for example, those based on ordered statistics decoding (OSD) algorithms [25], which exploit the concept of information set decoding (ISD) [26], aided by the soft information available at the channel output. An algorithm similar to ISD was also proposed in [27] to attack two authentication protocols which exploit some noisy observations.…”
Section: A Reliability and Security Targetsmentioning
confidence: 99%
“…Several options are available for this purpose, also exploiting LDPC-like code representations [14]. For this code, we have focused on the MRB algorithm [15], which has very good performance and acceptable complexity. It consists of the following steps: 1) Identify k = 64 most reliable received bits and obtain from them a vector v * .…”
Section: Extended Bch Codesmentioning
confidence: 99%
“…6) For each of them: sum to v * , encode by G * , verify if the likelihood is higher than that of the previous candidate codeword and, if this is true, update the candidate. Further details can be found in [15] and the references therein. The MRB algorithm can be applied also to the other schemes (to LDPC codes, in particular) where, depending on the order i, it can provide performance comparable to, or even better than, that offered by the iterative algorithms.…”
Section: Extended Bch Codesmentioning
confidence: 99%