- Definition
- Properties
- References
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.
References
- {{cite book | author=F.J. MacWilliams | authorlink=Jessie MacWilliams |author2=N.J.A. Sloane | title=The Theory of Error-Correcting Codes | publisher=North-Holland | date=1977 | isbn=0-444-85193-3 | pages=357–360 }}
3 : Error detection and correction|Finite fields|Coding theory
- UK–Uruguay relations
- U. K. – Uruguay relations
- U.K.–Uruguay relations
- U. K.–U.S. relations
- U. K.–US relations
- U.K. – US relations
- UK – U.S. relations
- UK – US relations
- U K–US relations
- UK–U.S. relations
- U K–U.S. relations
- U K – US relations
- U.K.–US relations
- U. K. – US relations
- U. K. – U.S. relations
- U.K. – U.S. relations
- U K – U.S. relations
- U.K.–U.S. relations
- UK–Uzbekistan relations
- U.K. – Uzbekistan relations
- UK – Uzbekistan relations
- U. K. – Uzbekistan relations
- U.K.–Uzbekistan relations
- U. K.–Uzbekistan relations
- UK–Venezuela relations