Presentation 2008-02-29
A Lower Bound on the Number of Uncorrectable Errors of Weight Half the Minimum Distance
Kenji YASUNAGA, Toru FUJIWARA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) 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 comes close to the corresponding upper bound for long Reed-Muller codes and random linear codes. The monotone error structure and its related notion larger half and trial set, which are introduced by Helleseth, Klφve, and Levenshtein, are mainly used to derive the bound.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Uncorrectable error / Reed-Muller code / random linear code / monotone error structure
Paper # IT2007-56,ISEC2007-153,WBS2007-87
Date of Issue

Conference Information
Committee ISEC
Conference Date 2008/2/22(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Lower Bound on the Number of Uncorrectable Errors of Weight Half the Minimum Distance
Sub Title (in English)
Keyword(1) Uncorrectable error
Keyword(2) Reed-Muller code
Keyword(3) random linear code
Keyword(4) monotone error structure
1st Author's Name Kenji YASUNAGA
1st Author's Affiliation Graduate School of Information Science and Technology, Osaka University()
2nd Author's Name Toru FUJIWARA
2nd Author's Affiliation Graduate School of Information Science and Technology, Osaka University
Date 2008-02-29
Paper # IT2007-56,ISEC2007-153,WBS2007-87
Volume (vol) vol.107
Number (no) 501
Page pp.pp.-
#Pages 6
Date of Issue