Computer Science – Information Theory
Scientific paper
2008-04-25
Computer Science
Information Theory
5 pages, to appear in ISIT 2008
Scientific paper
A lower bound on the number of uncorrectable errors of weight half the minimum distance is derived for binary linear codes satisfying some condition. The condition is satisfied by some primitive BCH codes, extended primitive BCH codes, Reed-Muller codes, and random linear codes. The bound asymptotically coincides with the corresponding upper bound for Reed-Muller codes and random linear codes. By generalizing the idea of the lower bound, a lower bound on the number of uncorrectable errors for weights larger than half the minimum distance is also obtained, but the generalized lower bound is weak for large weights. The monotone error structure and its related notion larger half and trial set, which are introduced by Helleseth, Kl{\o}ve, and Levenshtein, are mainly used to derive the bounds.
Fujiwara Toru
Yasunaga Kenji
No associations
LandOfFree
Uncorrectable Errors of Weight Half the Minimum Distance for Binary Linear Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Uncorrectable Errors of Weight Half the Minimum Distance for Binary Linear Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Uncorrectable Errors of Weight Half the Minimum Distance for Binary Linear Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-728085