It is shown that some well-known and some new cyclic codes with orthogonal parity-check equations can be constructed in the finite-field transform domain. It is also shown that, for some binary linear cyclic codes, the performance of the iterative decoder can be improved by substituting some of the dual code codewords in the parity-check matrix with other dual code codewords formed from linear ...

In this work we propose a generalization of the Hadamard product between two matrices to a tensor-valued, multi-linear product between k matrices for any k ≥ 1. A multi-linear dual operator to the generalized Hadamard product is presented. It is a natural generalization of the Diag x operator, that maps a vector x ∈ R into the diagonal matrix with x on its main diagonal. Defining an action of t...

The microstructure of dual phase steels can be considered as a matrix of ferrite phase reinforced by martensite particles. Recent measurements show that the mechanical properties of the ferrite phase are changed with the distance from the martensite grains. In this paper, a new method has been proposed to consider this phenomenon in finite element modeling of dual phase steels microstructure. I...

| The Gabor transform yields a discrete representation of a signal in the phase space 1, 2]. Since the Gabor transform is non-orthogonal, eecient reconstruction of a signal from its phase space samples is not straightforward and involves the computation of the so-called dual Gabor function. We present a unifying approach to the derivation of numerical algorithms for discrete Gabor analysis, bas...

In this paper, we introduce multivariate Goppa codes, which contain, as a particular case, the well-known classical codes. We provide parity check matrix for code in terms of tensor product generalized Reed-Solomon prove that codes are subfield subcodes augmented Cartesian By showing how new family relates to and obtain information about parameters, subcodes, duals, hulls see some instances, (r...

The pattern of a matrix M is a (0,1)-matrix which replaces all non-zero entries of M with a 1. There are several contexts in which studying the patterns of orthogonal matrices can be useful. One necessary condition for a matrix to be orthogonal is a property known as combinatorial orthogonality. If the adjacency matrix of a directed graph forms a pattern of a combinatorially orthogonal matrix, ...

The connection problem for orthogonal polynomials is, given a polynomial expressed in the basis of one set of orthogonal polynomials, computing the coefficients with respect to a different set of orthogonal polynomials. Expansions in terms of orthogonal polynomials are very common in many applications. While the connection problem may be solved by directly computing the change–of–basis matrix, ...