Srivastava code
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 ≥ n − ms and minimum distance ≥ s + 1.
gollark: Perhaps ask the PIERB. It knows stuff.
gollark: Interesting suggestion.
gollark: Do I?
gollark: I assume they're watching all things ever and will return an answer to you if they want.
gollark: By PIERB order.
References
- F.J. MacWilliams; N.J.A. Sloane (1977). The Theory of Error-Correcting Codes. North-Holland. pp. 357–360. ISBN 0-444-85193-3.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.