Permutations of the form \(F(x)=L_1(x^{-1})+L_2(x)\) with linear functions \(L_1,L_2\) are closely related to several interesting questions regarding CCZ-equivalence and EA-equivalence inverse function. In this paper, we show that F cannot be a permutation on binary fields if kernel \(L_1\) or \(L_2\) is large. A key step our proof an observation maximal size subspace V \(\mathbb {F}_{2^n}\) co...

The SPS-LASSO has recently been introduced as a solution to the problem of regularization parameter selection in the complex-valued LASSO problem. Still, the dependence on the grid size and the polynomial time of performing convex optimization technique in each iteration, in addition to the deficiencies in the low noise regime, confines its performance for Direction of Arrival (DOA) estimation....