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

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 GF(q) 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)

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1966
Accession Number
AD0630029

Entities

People

  • Vincent Lum

Organizations

  • University of Illinois Urbana–Champaign

Tags

Fields of Study

  • Mathematics

Readers

  • Electromagnetic Wave Scattering and Antenna Radiation Engineering
  • Graph Algorithms and Convex Optimization.