Srivastava code - Alchetron, The Free Social 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

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

[ α 1 μ α 1 − w 1 ⋯ α n μ α n − w 1 ⋮ ⋱ ⋮ α 1 μ α 1 − w s ⋯ α n μ α n − w s ]

where the α_i and z_i are elements of GF(q^m)

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

(Text) CC BY-SA