A Modified Blahut Algorithm for Decoding Reed–Solomon Codes Beyond Half the Minimum Distance

Egorov, S. I.; Markarian, Garik; Pickavance, Keith

doi:10.1109/tcomm.2004.838673

Cited by 12 publications

(16 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There is trade-off between the strength of the error correction code to protect the header and the space required to store the protection code. The work discussed in [3] and [4] can be one of the work-around solution for the problem.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

On the distribution of the length of bit errors in IP packet headers

Barukang

Markarian

2014

2014 IEEE Student Conference on Research and Development

View full text Add to dashboard Cite

This paper concerns itself with the distribution of the length of bit error in IP packet header. In this study, MAC frames (encapsulating the IP packets) are transmitted through an AWGN channel, modulated with BPSK, and at the receiver, the numbers of bit errors found in the header of every IP packets are recorded. The frequency distribution of the length of bit errors is computed and plotted. Result shows that in an un-coded channel, the length of errors that has the highest probability to occur is about 21-bits, and for coded channel, it was about 60-bits. However, the probability of having the 21-bits long bit errors in the un-coded channel is significantly higher than the probability of having the 60-bits long bit errors in the coded channel. For an un-coded channel, bit errors can be found in the header up to +10dB SNR, while in the coded channel, it can be found only up to +6dB SNR. This result is beneficial in deciding on an optimal numbers of redundancy bits needed to protect the IP packet header.

show abstract

Section: Discussionmentioning

confidence: 99%

“…There are several error correcting codes suitable to encode the IP header, such as the Reed-Solomon code, Extended t+1 Reed Solomon code [4], Generalised Array Code (GAC) [5], Hamming code and several other systematic codes.…”

Section: B Transmission With Channel Codesmentioning

confidence: 99%

On the distribution of the length of bit errors in IP packet headers

Barukang

Markarian

2014

2014 IEEE Student Conference on Research and Development

View full text Add to dashboard Cite

show abstract

“…PREPRINT --PREPRINT --PREPRINT --PREPRINT - 2 The inverse discrete Fourier Transform is calculated by p(x) = F −1 (P (x)) = p 0 + p 1 x + · · · + p n−1 x n−1 , where P (x) is a polynomial of deg(P (x)) ≤ n − 1, and p i = n −1 P (α −i ). In the terminology of the Fourier Transform we call p(x) time domain polynomial and P (x) the frequency domain polynomial or the spectrum of p(x).…”

Section: Reed-solomon Codesmentioning

confidence: 99%

“…Such classical BMD decoding approaches are mostly syndrome based, i.e., they work by creating a syndrome from the received word, which allows to uniquely reconstruct the error pattern, provided that its weight is not larger than half the minimum distance of the code. There have been several straight forward approaches like [1] and [2] for extending these syndrome based techniques for decoding errors beyond half the minimum distance using an extensive post processing step. However, for complexity reasons the decoding radius can usually only be slightly increased using such techniques.…”

Section: Introductionmentioning

confidence: 99%

Syndrome Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis

Schmidt

Sidorenko

Bossert

2010

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

In this paper, a new approach for decoding lowrate Reed-Solomon codes beyond half the minimum distance is considered and analyzed. Unlike the Sudan algorithm published in 1997, this new approach is based on multi-sequence shiftregister synthesis, which makes it easy to understand and simple to implement. The computational complexity of this shift-register based algorithm is of the same order as the complexity of the well-known Berlekamp-Massey algorithm. Moreover, the error correcting radius coincides with the error correcting radius of the original Sudan algorithm, and the practical decoding performance observed on a q-ary symmetric channel (QSC) is virtually identical to the decoding performance of the Sudan algorithm. Bounds for the failure and error probability as well as for the QSC decoding performance of the new algorithm are derived, and the performance is illustrated by means of examples.Index Terms-Reed-Solomon codes, decoding beyond half the minimum distance, Interleaved Reed-Solomon codes, multisequence shift-register synthesis,

show abstract

“…K-octets Dota 2t-octets Pority It is known that an RS code [3] has minimal code separation space dmi n = N -K + 1 and the number of correctable encoding and decoding can be found in [4] and an extended decoding algorithm [5].…”

Section: N-octets Codewordmentioning

confidence: 99%

Investigation on data link layer ARQ and HARQ retransmission rates

Barukang

Fan

2010

2010 IEEE Student Conference on Research and Development (SCOReD)

View full text Add to dashboard Cite

This paper, we present a simulation result on retransmission rates of an HARQ (Hybrid Automatic Repeat Request) and pure ARQ schemes at different channel Signal-to Noise ratio (SNR). We showed that retransmission is improved by as much as 2dB when HARQ was used. It was also shown that HARQ retransmission scheme perform well at lower SNR. The result of this investigation will helps us in the design of an augmented Hybrid Type-II ARQ retransmission scheme.

show abstract

A Modified Blahut Algorithm for Decoding Reed–Solomon Codes Beyond Half the Minimum Distance

Cited by 12 publications

References 6 publications

On the distribution of the length of bit errors in IP packet headers

On the distribution of the length of bit errors in IP packet headers

Syndrome Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis

Investigation on data link layer ARQ and HARQ retransmission rates

Contact Info

Product

Resources

About