Beamspace Root-MUSIC is a computationally efficient, beamspace implementation of Root-MUSIC developed recently for use in conjunction with a uniform linear array (ULA). Employing B real-valued beams having all but B-1 nulls in common, the major computations in Beamspace Root-MUSIC are a BxB real-valued eigenvalue decomposition (EVD) and the rooting of a polynomial of order B-1. Recently, Beamsp...

The code equivalence problem is to decide whether two linear codes over Fq are identical up to a linear isometry of the Hamming space. In this paper, we review the hardness of code equivalence over Fq due to some recent negative results and argue on the possible implications in code-based cryptography. In particular, we present an improved version of the three-pass identification scheme of Gira...

In the present paper, we study some properties of fuzzy norm of linear operators. At first the bounded inverse theorem on fuzzy normed linear spaces is investigated. Then, we prove Hahn Banach theorem, uniform boundedness theorem and closed graph theorem on fuzzy normed linear spaces. Finally the set of all compact operators on these spaces is studied.

l1 minimization is often used for finding the sparse solutions of an under-determined linear system. In this paper we focus on finding sharp performance bounds on recovering approximately sparse signals using l1 minimization, possibly under noisy measurements. While the restricted isometry property is powerful for the analysis of recovering approximately sparse signals with noisy measurements, ...