Accession Number:

AD0630029

Title:

A THEOREM ON THE MINIMUM DISTANCE OF BCH CODES OVER GF(Q),

Descriptive Note:

Corporate Author:

ILLINOIS UNIV URBANA COORDINATED SCIENCE LAB

Personal Author(s):

Report Date:

1966-03-01

Pagination or Media Count:

26.0

Abstract:

This paper presents a generalization of Mattson-Solomon method for finding the minimum distance of a class of BCH codes. The theorem derived makes it possible to determine fairly easily if a particular code over GFq satisfies the conditions set forth and hence has minimum distance exceeding the BCH bound. Application of the theorem is given and numerous examples are presented. Author

Subject Categories:

  • Cybernetics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE