Let R be a commutative ring, q a unit of R and P a multiplicatively antisymmetric matrix with coefficients which are integer powers of q. Denote by SE(q,P) the multiparameter quantum matrix bialgebra associated to q and P. Slightly generalizing [H-H], we define a multiparameter deformation Lλ/μVP of the classical skew Schur module. In case R is a field and q is not a root of 1, arguments like t...

A parity-check matrix for a q -ary repeated-root cyclic code is derived using the Hasse derivative. Then the min imum distance of a q-ary repeated-root cyclic code C is expressecin terms of the min imum distance of a certain simple-root cyclic code C that is determined by C. With the help of this result, several binary repeated-root cyclic codes of lengths up to n = 62 are shown to contain the ...

We describe the results of a computer-based search for 5 and 6dimensional lattice rules of specified trigonometric degree. In this search only lattice rules that can be generated by a circulant or skew-circulant generator matrix are considered, which makes this approach significantly faster than earlier approaches. The drawback is that we do not necessarily obtain optimal lattice rules. We also...

We study the solutions of Hermitian positive deenite Toeplitz systems Ax = b by the preconditioned conjugate gradient method for three families of circulant preconditioners C. The convergence rates of these iterative methods depend on the spectrum of C ?1 A. For a Toeplitz matrix A with entries which are Fourier coeecients of a positive function f in the Wiener class, we establish the invertibl...

A) , (L J regular QC-LDPC code of length N is defined by a parity-check matrix L L p I p I p I p I p I p I p I p I p I H     (1) where 1 1    J j , 1 1    L l and   l j p I , represents the p p  circulant permutation matrix obtained by cyclically right-shifting the p p  identity matrix   0 I by l j p , positions, with. / L N p  For a specific QC-LDPC code we define the correspo...

We design heuristic algorithms to construct Hadamard matrices with two circulant cores. This hard combinatorial problem can be formulated in terms of objective functions of several binary variables, so that heuristic methodologies can be used. Our algorithms are based on local and tabu search and they use information on the geometry of the objective function landscapes. In addition, we use the ...

As part of a survey of state-of-the-art kernel approximation algorithms, we present a new sampling algorithm for circulant matrix construction to perform fast kernel matrix inversion in kernel ridge regression, comparing theoretical and experimental performance of that of multilevel circulant kernel approximation, incomplete Cholesky decomposition, and random features, all recent advances in th...