In this paper, we give an almost complete classication of toric surface codes of dimension less than or equal to 7, according to monomially equivalence. This is a natural extension of our previous work [YZ], [LYZZ]. More pairs of monomially equivalent toric codes constructed from non-equivalent lattice polytopes are discovered. A new phenomenon appears, that is, the monomially non-equivalence of two toric codes C P(10)7and CP(19)7 can be discerned on Fq, for all q  8, except q = 29. This sudden break seems to be strange and interesting. Moreover, the parameters, such as the numbers of codewords with dierent weights, depends on q heavily. More meticulous analyses have been made to have the possible distinct families of reducible polynomials.

In this paper, we prove that the degree of regularity of square systems, a subfamily of the HFE systems, over a prime finite field of odd characteristic q is exactly q and, therefore, prove that inverting square systems algebraically using Gröbner basis algorithm is exponential, when q = \Omega(n), where n is the number of variables of the system.

The moment-entropy inequality shows that a contin- uous random variable with given second moment and maximal Shannon entropy must be Gaussian. Stam’s inequality shows that a continuous random variable with given Fisher information and minimal Shannon entropy must also be Gaussian. The Crame ́r- Rao inequality is a direct consequence of these two inequalities. In this paper the inequalities above are extended to Renyi entropy, p-th moment, and generalized Fisher information. Gen- eralized Gaussian random densities are introduced and shown to be the extremal densities for the new inequalities. An extension of the Crame ́r–Rao inequality is derived as a consequence of these moment and Fisher information inequalities.

In this paper we analyze the Kahrobaei-Lam-Shpilrain (KLS) key exchange protocols that use extensions by endomorpisms of matrices over a Galois field proposed in \cite{Kahrobaei-Lam-Shpilrain:2014}. We show that both protocols are vulnerable to a simple linear algebra attack.

We study the super-resolution (SR) problem of recovering point sources consisting of a collection of isolated and suitably separated spikes from only the low frequency measurements. If the peak separation is above a factor in $(1, 2)$ of the Rayleigh length (physical resolution limit), L1 minimization is guaranteed to recover such sparse signals. However, below such critical length scale, especially the Rayleigh length, the $L_1$ certificate no longer exists. We show several local properties (local minimum, directional stationarity, and sparsity) of the limit points of minimizing two $L_1$ based nonconvex penalties, the difference of $L_1$ and $L_2$ norms $(L_{1-2})$ and capped $L_1 (CL_1)$, subject to the measurement constraints. In one and two dimensional numerical SR examples,the local optimal solutions from dierence of convex function algorithms outperform the global L1 solutions near or below Rayleigh length scales either in the accuracy of ground truth recovery or in nding a sparse solution satisfying the constraints more accurately.