Abstract :
Srivastava codes, a class of linear noncyclic error-correcting codes, offer performance potentially superior tO that of comparable BCH codes. Their properties are investigated by equivalence classification and subsequent computer evaluation of their weight spectra. In the process a constructive upper bound is obtained on the number of equivalence classes of Srivastava codes, a class of binary Srivastava codes whose parity-check matrices have row rank less than the maximum, and a class of binary double-error,correcting codes w!th highly structured parity-check matrices. A number of shortened binary Srivastava codes with minimum distances superior to those of the best comparable linear codes known are also presented.
