Some efficient binary codes constructed using Srivastava codes (Corresp.)

In this correspondence, we construct a new class of binary codes by exploiting the symmetry properties of the parity check matrix of the Srivastava codes. The construction is a generalization of Goppa´s construction [1]. A number of the binary codes constructed are proved equal, or superior, to the best codes previously known.