On the Condition for Detecting (t+μ)-error by Reed-Solomon Decoder Based on the Welch-Berlekamp Algorithm
スポンサーリンク
概要
- 論文の詳細を見る
It is known that the t-error-correcting Reed-Solomon code can detect more than t errors with high probability, and it is remarkable in case of t≥5. For the decoding algorithm based on the syndrome such as Euclidian algorithm and Berlekamp-Massey algorithm, the conditions of the error-locator-polynomial for detecting the (t+μ)-error (μ≥1) have been shown. Using the condition for detecting the (t+μ)-error, we can detect more than t errors and correct it. On the other hand, we have shown that the similar condition for detecting the (t+μ)-error by Welch-Berlekamp algorithm which is known as the non-syndrome decoder. It consists of three conditions concerned with the error-locator-polynomial. However, we found that the condition for detecting (t+μ)-error by Welch-Berlekamp algorithm can be simple more. In this paper, we show a new condition for detecting the (t+μ)-error by Welch-Berlekamp algorithm. It consists of only two conditions. The two conditions are confirmed by numerical experiments.
- 社団法人電子情報通信学会の論文
- 2005-05-19
著者
-
MORII Masakatu
Graduate School of Engineering, Kobe University
-
Morii Masakatu
Graduate School Of Engineering Kobe University
-
Mohri Masami
Information And Multimedia Center Gifu University
-
Mohri Masami
The University Of Tokushima Dept. Of Information Science & Intelligent Systems
-
MORII Masakatu
The University of Tokushima, Dept. of Information Science & Intelligent Systems
関連論文
- A Chosen-IV Key Recovery Attack on Py and Pypy
- A Chosen-IV Key Recovery Attack on Py and Pypy
- A-6-8 Improved Bitslice Network for Computing the TIB3 S-Box
- Fast WEP-Key Recovery Attack Using Only Encrypted IP Packets
- Reversible Watermark with Large Capacity Based on the Prediction Error Expansion
- Fingerprinting Protocol Based on Distributed Providers Using Oblivious Transfer(Cryptography,Information Theory and Its Applications)
- Reversible Watermark with Large Capacity Based on the Prediction Error
- Reversible Watermark with Large Capacity Using the Predictive Coding
- S-Box Bitslice Networks as Network Computing
- New Weakness in the Key-Scheduling Algorithm of RC4
- Internal-State Reconstruction of a Stream Cipher RC4(Information Security)(Information Theory and Its Applications)
- Compression Functions Suitable for the Multi-Property-Preserving Transform
- Systematic Generation of Tardos's Fingerprint Codes
- A Probabilistic Algorithm for Computing the Weight Distribution of LDPC Codes
- On the Reliability for the Weight Distribution of LDPC codes Computed by the Probabilistic Algorithm(HISC2006)
- On the Condition for Detecting (t+μ)-error by Reed-Solomon Decoder Based on the Welch-Berlekamp Algorithm
- Generalized Classes of Weak Keys on RC4 Using Predictive State
- Irreducible m-Term Polynomial and Its Application to Multiplication over GF(2^m)
- Cryptanalysis for RC4 and Breaking WEP/WPA-TKIP
- Falsification Attacks against WPA-TKIP in a Realistic Environment
- On the Probabilistic Computation Method with Reliability for the Weight Distribution of LDPC Codes
- Comprehensive Analysis of Initial Keystream Biases of RC4
- Anonymous Authentication Scheme without Verification Table for Wireless Environments