Accession Number : AD0654676

Title :   LONG BCH CODES ARE BAD,

Corporate Author : HAWAII UNIV HONOLULU DEPT OF ELECTRICAL ENGINEERING

Personal Author(s) : Lin,S. ; Weldon,E. J. , Jr

Report Date : 15 FEB 1967

Pagination or Media Count : 17

Abstract : 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.

Descriptors :   (*CODING, ERRORS), INFORMATION THEORY, MATHEMATICAL ANALYSIS, EFFICIENCY, RANDOM VARIABLES

Subject Categories : Numerical Mathematics
      Cybernetics

Distribution Statement : APPROVED FOR PUBLIC RELEASE