In coding theory, Srivastava codes, formulated by Professor J. N. Srivastava, form a class of parameterised error-correcting codes which are a special case of alternant codes.

Definition

The original Srivastava code over GF(q) of length n is defined by a parity check matrix H of alternant form

where the αi and zi are elements of GF(qm)

Properties

The parameters of this code are length n, dimension ≥ nms and minimum distance ≥s+1.

Related constructions

The symmetry properties of Srivastava-code parity-check matrices have been used to construct binary codes, including a construction that generalizes Goppa's construction.

References