|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'928
Articles rated: 2609
25 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Adaptive Single-Trial Error/Erasure Decoding of Reed-Solomon Codes | | Christian Senger
; Vladimir R. Sidorenko
; Steffen Schober
; Martin Bossert
; Victor V. Zyablov
; | | Date: |
4 Apr 2011 | | Abstract: | Algebraic decoding algorithms are commonly applied for the decoding of
Reed-Solomon codes. Their main advantages are low computational complexity and
predictable decoding capabilities. Many algorithms can be extended for
correction of both errors and erasures. This enables the decoder to exploit
binary quantized reliability information obtained from the transmission
channel: Received symbols with high reliability are forwarded to the decoding
algorithm while symbols with low reliability are erased. In this paper we
investigate adaptive single-trial error/erasure decoding of Reed-Solomon codes,
i.e. we derive an adaptive erasing strategy which minimizes the residual
codeword error probability after decoding. Our result is applicable to any
error/erasure decoding algorithm as long as its decoding capabilities can be
expressed by a decoder capability function. Examples are Bounded Minimum
Distance decoding with the Berlekamp-Massey- or the Sugiyama algorithms and the
Guruswami-Sudan list decoder. | | Source: | arXiv, 1104.0576 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER