In the context of constant-dimension subspace codes, an important problem is to determine largest possible size $ A_q(n, d; k) codes whose codewords are k $-subspaces {\mathbb F}_q^n with minimum distance d $. Here in order obtain improved constructions, we investigate several approaches combine codes. This allow us present improvements on lower bounds for many parameters, including A_q(10, 4; ...

a new guideline for proper allocation of multipoles in the multiple multipole method (mmp) is proposed. in an ‘a posteriori’ approach, subspace fitting (ssf) is used to find the best location of multipole expansions for the two dimensional dielectric scattering problem. it is shown that the best location of multipole expansions (regarding their global approximating power) coincides with the med...

let $mathcal{a}$ be a banach algebra with bai and $e$ be an introverted subspace of $mathcal{a'}$.in this paper we study the quotient arens regularity of $mathcal{a}$ with respect to $e$ and prove that the group algebra $l^1(g)$ for a locally compact group $g$, is quotient arens regular with respect to certain introverted subspace $e$ of $l^infty(g)$.some related result are given as well.

Calibration of expensive computer models using emulators for high-dimensional output fields can become increasingly intractable with the size field(s) being compared to observational data. In these settings, dimension reduction is attractive, reducing number required mimic by orders magnitude. By comparing popular independent emulation approaches that fit univariate each grid cell in field, we ...

In this paper we consider blind signal detection for an asynchronous code division multiple access (CDMA) system with Principal component analysis (PCA) in impulsive noise. The blind multiuser detector requires no training sequences compared with the conventional multiuser detection receiver. The proposed PCA blind multiuser detector is robust when compared with knowledge based signature wavefo...

We introduce a hybrid projection-localization method for solving large convex cone programs. The method interleaves a series of projections onto localization sets with the classical alternating projections method for convex feasibility problems; the problem is made amenable to the method by reducing it to a convex feasibility problem composed of a subspace and a cone via its homogeneous self-du...