LONG BCH CODES ARE BAD,
HAWAII UNIV HONOLULU DEPT OF ELECTRICAL ENGINEERING
Pagination or Media Count:
Of the numerous classes of random-error-correcting codes proposed to date, the class discovered by Bose and Chaudhuri 1960 and, independently and earlier by Hocquenghem 1959 are easily the most widely renowned. However, it has been observed that the BCH bound approaches zero with increasing code length for any fixed value of the ratio of minimum distance to code length. This paper shows that it is the codes, and not the bound, which deteriorate with increasing code length.
- Numerical Mathematics