Let R be a commutative ring with identity, N be an R-module, and M = (a,/),.Γ~. be a matrix over R. A linear code C of length n over N is defined to be a submodule of N '~. It is shown that a linear code C(k, r) with parity check matrix (-MI/,.) is maximum distance separable (MDS) iff the determinan
Linear Recursive MDS-Codes and Asturian codes
β Scribed by Elena Couselo; Santos Gonzalez; Victor Markov; Alexandr Nechaev
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 434 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We obtain some e!ective lower and upper bounds for the number of (n, k)-MDS linear codes over % O . As a consequence, one obtains an asymptotic formula for this number. These results also apply for the number of inequivalent representations over % O of the uniform matroid or, alternatively, the numb
Cyclic arcs (defined by Storme and Van Maldghem, [1994]) and pseudo-cyclic MDS codes are equivalent objects. We survey known results on the existence of cyclic arcs. Some new results on cyclic arcs in PG(2, q) are also given.