# Srivastava code

**Srivastava codes**, formulated by Professor , form a class of parameterised error-correcting codes which are a special case of alternant codes.

## Contents

## Definition

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

where the α_{i} and *z*_{i} are elements of GF(*q*^{m})

## Properties

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