# Srivastava code

From BitcoinWiki

This is the approved revision of this page, as well as being the most recent.

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

## Contents

## 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 *z*_{i} are elements of GF(*q*^{m})

## Properties[edit]

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

## Source[edit]

## See Also on BitcoinWiki[edit]