Matrix characterization of MDS linear codes over modules
β Scribed by Xue-Dong Dong; Cheong Boon Son; Erry Gunawan
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 205 KB
- Volume
- 277
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
β¦ Synopsis
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 determinant of every h Γ h submatrix, h = 1,2,..., rain{k, r}, of M is not an annihilator of any nonzero element of N. This characterization is used to derive some results for group codes over abelian groups.
π SIMILAR VOLUMES
Let R be a connected commutative ring with identity 1 (R contains no idempotents except 0 and 1), and let M n (R) be the R-module of all n Γ n matrices over R. R is said to be idempotence-diagonalizable if every idempotent matrix over R is similar to a diagonal matrix. For two arbitrary positive int
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
Let R be a commutative principal ideal domain, T : Mn(R) --\* Mm(R) an R-linear map which preserves idempotence. We determine the forms of T when n >/m and R ~ Fz, and solve some of Beasley's open problems. As a consequence, we prove that the set -~(R) of all R-linear maps on Mn(R) which preserve bo