Unitary completions of complex symmetric and skew symmetric matrices.
On the joint 2-adic complexity of binary multisequences
Joint 2-adic complexity is a new important index of the cryptographic security for multisequences. In this paper, we extend the usual Fourier transform to the case of multisequences and derive an upper bound for the joint 2-adic complexity. Furthermore, for the multisequences with -period, we discuss the relation between sequences and their Fourier coefficients. Based on the relation, we determine a lower bound for the number of multisequences with given joint 2-adic complexity.
On the joint 2-adic complexity of binary multisequences
Joint 2-adic complexity is a new important index of the cryptographic security for multisequences. In this paper, we extend the usual Fourier transform to the case of multisequences and derive an upper bound for the joint 2-adic complexity. Furthermore, for the multisequences with -period, we discuss the relation between sequences and their Fourier coefficients. Based on the relation, we determine a lower bound for the number of multisequences...
A new system of generalized nonlinear relaxed cocoercive variational inequalities.
On numerical range of sp(2n, C)
In this paper we studied the classical numerical range of matrices in sp(2n, C). We obtained some result on the relationship between the numerical range of a matrix in and that [...] of its diagonal block, the singular values of its off-diagonal block A2.
Page 1