Srivastava code
Encyclopedia
In coding theory
Coding theory
Coding theory is the study of the properties of codes and their fitness for a specific application. Codes are used for data compression, cryptography, error-correction and more recently also for network coding...

, Srivastava codes form a class of parameterised error-correcting codes
Error detection and correction
In information theory and coding theory with applications in computer science and telecommunication, error detection and correction or error control are techniques that enable reliable delivery of digital data over unreliable communication channels...

 which are a special case of alternant code
Alternant code
In coding theory, alternant codes form a class of parameterised error-correcting codes which generalise the BCH codes.-Definition:An alternant code over GF of length n is defined by a parity check matrix H of alternant form Hi,j = αjiyi, where the αj are distinct elements of the extension GF, the...

s.

Definition

The original Srivastava code over GF(q) of length n is defined by a parity check matrix H of alternant
Alternant matrix
In linear algebra, an alternant matrix, is a matrix with a particular structure, in which successive columns have a particular function applied to their entries. An alternant determinant is the determinant of an alternant matrix...

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.
The source of this article is wikipedia, the free encyclopedia.  The text of this article is licensed under the GFDL.
 
x
OK