| 講演内容 |
In ISITA2008, it was shown that erasure-only decoding succeeds for generic errors up to (n-k) beyond (d-1)/2 in algebraic geometry codes with (n-k) redundant symbols and d Feng-Rao minimum distance bound. In this study, it is shown that erasure-error decoding also succeeds for generic errors beyond (d-1)/2 in algebraic geometry codes, and that, for Hermitian codes on GF(q^2), the improved erasure bound u* from the ordinary erasure bound u=d-1-2t can be explicitly written as u*=u+T(q-n) if t<T(n+1), where t is the number of errors and T(n) is the triangular number T(n)=max{0,n(n+1)/2}. |
