• Korean Journal of Mathematics
• /
• v.22 no.3
• /
• pp.443-454
• /
• 2014

In this paper, we give linearization of generalized Fi-bonacci sequences {$g_n$} and {$q_n$}, respectively, defined by Eq.(5) and Eq.(6) below and use this result to give the matrix form of the nth power of a companion matrix of {$g_n$} and {$q_n$}, respectively. Then we re-prove the Cassini's identity for {$g_n$} and {$q_n$}, respectively.

• Journal of applied mathematics & informatics
• /
• v.8 no.2
• /
• pp.651-658
• /
• 2001

The projection matrix plays an important role in the linear model theory. In this paper we derive an algebraic relationship between the projection matrices of submatrices of the design matrix. Using this relationship we can easily obtain the projection matrices of any submatrices of the design matrix. Also we show that every projection matrix can be obtained as a linear combination of Kronecker products of identity matrices and matrices with all elements equal to 1.

• Journal of electromagnetic engineering and science
• /
• v.6 no.4
• /
• pp.244-252
• /
• 2006

A block Jacket transform and. its block inverse Jacket transformn have recently been reported in the paper 'Fast block inverse Jacket transform'. But the multiplication of the block Jacket transform and the corresponding block inverse Jacket transform is not equal to the identity transform, which does not conform to the mathematical rule. In this paper, new binary block Jacket transforms and the corresponding binary block inverse Jacket transforms of orders $N=2^k,\;3^k\;and\;5^k$ for integer values k are proposed and the mathematical proofs are also presented. With the aid of the Kronecker product of the lower order Jacket matrix and the identity matrix, the fast algorithms for realizing these transforms are obtained. Due to the simple inverse, fast algorithm and prime based $P^k$ order of proposed binary block inverse Jacket transform, it can be applied in communications such as space time block code design, signal processing, LDPC coding and information theory. Application of circular permutation matrix(CPM) binary low density quasi block Jacket matrix is also introduced in this paper which is useful in coding theory.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.4
• /
• pp.27-32
• /
• 2014

Two-dimensional hybrid codewords are generated by using each row of identity matrix for spatial encoding and nonideal symmetric balance incomplete block design(BIBD) code for spectral encoding. This spatial/spectral optical code-division multiple-access (OCDMA) network uses single-balanced detectors to abstract the desired information bits and to eliminate the multiple-access interference(MAI). Analytical results show that the number of simultaneous users increases significantly by using the proposed hybrid codes.

• Bulletin of the Korean Mathematical Society
• /
• v.32 no.2
• /
• pp.337-342
• /
• 1995

A semiring is a binary system $(S, +, \times)$ such that (S, +) is an Abelian monoid (identity 0), (S,x) is a monoid (identity 1), $\times$ distributes over +, 0 $\times s s \times 0 = 0$ for all s in S, and $1 \neq 0$. Usually S denotes the system and $\times$ is denoted by juxtaposition. If $(S,\times)$ is Abelian, then S is commutative. Thus all rings are semirings. Some examples of semirings which occur in combinatorics are Boolean algebra of subsets of a finite set (with addition being union and multiplication being intersection) and the nonnegative integers (with usual arithmetic). The concepts of matrix theory are defined over a semiring as over a field. Recently a number of authors have studied various problems of semiring matrix theory. In particular, Minc [4] has written an encyclopedic work on nonnegative matrices.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.1
• /
• pp.173-176
• /
• 1987

This paper presents a simple factorization of the Hadamard matrix which is used to develop a fast algorithm for the Hadamard transform. This matrix decomposition is of the kronecker products of identity matrices and successively lower order Hadamard matrices. This following shows how the Kronecker product can be mathematically defined and efficiently implemented using a factorization matrix methods.

• Honam Mathematical Journal
• /
• v.35 no.2
• /
• pp.211-223
• /
• 2013

We consider permanent function on the faces of the polytope of certain doubly stochastic matrices, whose nonzero entries coincide with those of fully indecomposable square (0, 1)-matrices containing identity submatrix. We determine the minimum permanents and minimizing matrices on the given faces of the polytope using the contraction method.

• Journal of the Chungcheong Mathematical Society
• /
• v.14 no.2
• /
• pp.19-26
• /
• 2001

All rings are assumed to be associative but do not necessarily have an identity. In this paper, we carry out a study of ring theoretic properties of formal triangular matrix rings. Some results are obtained on these rings concerning properties such as being $I_0$-ring, I-ring, exchange ring.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.4
• /
• pp.1017-1031
• /
• 2016

Let R be a commutative ring with the non-zero identity and n be a natural number. ${\Gamma}^n_R$ is a simple graph with $R^n{\setminus}\{0\}$ as the vertex set and two distinct vertices X and Y in $R^n$ are adjacent if and only if there exists an $n{\times}n$ lower triangular matrix A over R whose entries on the main diagonal are non-zero such that $AX^t=Y^t$ or $AY^t=X^t$, where, for a matrix B, $B^t$ is the matrix transpose of B. ${\Gamma}^n_R$ is a generalization of Cayley graph. Let $T_n(R)$ denote the $n{\times}n$ upper triangular matrix ring over R. In this paper, for an arbitrary ring R, we investigate the properties of the graph ${\Gamma}^n_{T_n(R)}$.

• Journal of applied mathematics & informatics
• /
• v.26 no.5_6
• /
• pp.1185-1189
• /
• 2008

In this paper we show that the polynomial of degree 9 called generalized algebraicity is a polynomial identity for $3{\times}3$ matrices. ([5])