A new class of random error correcting codes

Abstract

Summary form only given, as follows. The author considers the design of binary block codes that are capable of correcting up to two symmetric errors. These codes are based on equations similar to those of BCH codes, but their efficiencies differ. Efficiencies vary from matching the best known codes to being inferior to BCH codes. The construction principle is novel, and the author contends that decoding is simpler.