NON-PRIMITIVE REED-MULLER CODES,
Abstract
A new class of random-error-correcting codes is presented. These codes are called non-primitive Reed-Muller codes because of their close relationship to the (primitive) Reed-Muller codes. It is shown that the class of non-primitive Reed-Muller codes contains the projective geometry codes discovered by Rudolph as a subclass. These latter codes are investigated in detail and two results proved. First, the codes are moderately efficient random-error-correctors for practical values of code length and rate. Second, they can be decoded with a relatively modest amount of equipment. As such it appears that these codes may be suitable for use in error control systems requiring random-error correction.
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 15, 1967
- Accession Number
- AD0654674
Entities
People
- E. J. Weldon Jr
Organizations
- University of Hawaiʻi System