LONG BCH CODES ARE BAD,

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.

Document Details

Document Type
Technical Report
Publication Date
Feb 15, 1967
Accession Number
AD0654676

Entities

People

  • E. J. Weldon Jr
  • Sharon Lin

Organizations

  • University of HawaiĘ»i System

Tags

Readers

  • Computer Programming and Software Development.
  • Educational Psychology