Srivastava code

From Wikipedia, the free encyclopedia

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[edit]

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[edit]

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

References[edit]

  • F.J. MacWilliams; N.J.A. Sloane (1977). The Theory of Error-Correcting Codes. North-Holland. pp. 357–360. ISBN 0-444-85193-3.