It is well known that cyclic codes are very useful because of their applications, since they are not computationally expensive and encoding can be easily implemented. The relationship between cyclic codes and invariant subspaces is also well known. In this paper a generalization of this relationship is presented between monomial codes over a finite field 𝔽 and hyperinvariant subspaces of 𝔽n under an appropriate linear transformation. Using techniques of Linear Algebra it is possible to deduce certain properties for this particular type of codes, generalizing known results on cyclic codes.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
L. Huang [Consimilarity of quaternion matrices and complex matrices, Linear Algebra Appl. 331 (2001) 21–30] gave a canonical form of a quaternion matrix with respect to consimilarity transformations A ↦ ˜S−1AS in which S is a nonsingular quaternion matrix and h = a + bi + cj + dk ↦ ˜h := a − bi + cj − dk (a, b, c, d ∈ ℝ). We give an analogous canonical form of a quaternion matrix with respect to consimilarity transformations A ↦^S−1AS in which h ↦ ^h is an arbitrary involutive automorphism of the skew field of quaternions. We apply the obtained canonical form to the quaternion matrix equations AX −^X B = C and X − A^X B = C.
3
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
Drew, Johnson and Loewy conjectured that for n ≥ 4, the CP-rank of every n × n completely positive real matrix is at most [n2/4]. In this paper, we prove this conjecture for n × n completely positive matrices over Boolean algebras (finite or infinite). In addition,we formulate various CP-rank inequalities of completely positive matrices over special semirings using semiring homomorphisms.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.