Modified algebraic decoding of the (89, 45, 17) binary quadratic residue code

Abstract

Binary quadratic residue (QR) codes, which have code rates greater than or equal to 1/2 and generally have large minimum distances, are among the best known codes. This paper considers a modified algebraic decoding algorithm for the (89,45,17) binary QR code that utilizes the Berlekamp-Massey algorithm. It identifies the primary unknown syndromes and provides methods to determine these on a case-by-case basis for any number of correctable errors. Numerical evaluation shows that the proposed algorithm significantly reduces at least 52% of decoding time for two or more errors.