Construction of extremal Type II Z2k-codes

We give methods for constructing many self-dual ${\mathbb{Z}}_m$-codes and Type II ${\mathbb{Z}}_{2k}$-codes of length 2n starting from a given self-dual ${\mathbb{Z}}_m$-code and Type II ${\mathbb{Z}}_{2k}$-code of length 2n, respectively. As an application, we construct extremal Type II ${\mathbb{Z}}_{2k}$-codes of length 24 for $k=4,5,\dots ,20$ and extremal Type II ${\mathbb{Z}}_{2k}$-codes of length 32 for $k=4,5,\dots ,10$. We also construct new extremal Type II ${\mathbb{Z}}_4$-codes of lengths 56 and 64.     

Perfect squares representing the number of rational points on elliptic curves over finite field extensions

Let q be a perfect power of a prime number p and $E({\mathbb{F}}_q)$ be an elliptic curve over ${\mathbb{F}}_q$ given by the equation $y^2=x^3+Ax+B$. For a positive integer n we denote by $\mathrm{\#}E({\mathbb{F}}_{q^n})$ the number of rational points on E (including infinity) over the extension ${\mathbb{F}}_{q^n}$. Under a mild technical condition, we show that the sequence ${\{\mathrm{\#}E({\mathbb{F}}_{q^n})\}}_{n>0}$ contains at most 10²⁰⁰ perfect squares. If the mild condition is not satisfied, then $\mathrm{\#}E({\mathbb{F}}_{q^n})$ is a perfect square for infinitely many n including all the multiples of 12. Our proof uses a quantitative version of the Subspace Theorem. We also find all the perfect squares for all such sequences in the range $q<50$ and $n\le 1000$.     

Some new results on dimension and Bose distance for various classes of BCH codes

In this paper, we give the dimension and the minimum distance of two subclasses of narrow-sense primitive BCH codes over ${\mathbb{F}}_q$ with designed distance $\delta =a{q}^{m-1}-1(\text{resp. }\delta =a\frac{q^m-1}{q-1})$ for all $1\le a\le q-1$, where q is a prime power and $m>1$ is a positive integer. As a consequence, we obtain an affirmative answer to two conjectures proposed by C. Ding in 2015. Furthermore, using the previous part, we extend some results of Yue and Hu [16], and we give the dimension and, in some cases, the Bose distance for a large designed distance in the range $[a\frac{q^m-1}{q-1},a\frac{q^m-1}{q-1}+T]$ for $0\le a\le q-2$, where $T=q^{\frac{m+1}{2}}-1$ if m is odd, and $T=2q^{\frac{m}{2}}-1$ if m is even.     

Packed words and quotient rings

The coinvariant algebra is a quotient of the polynomial ring $\mathbb{Q}[x_1,\dots ,x_n]$ whose algebraic properties are governed by the combinatorics of permutations of length n. A word $w=w_1\dots w_n$ over the positive integers is packed if whenever $i>2$ appears as a letter of w, so does $i?1$. We introduce a quotient $S_n$ of $\mathbb{Q}[x_1,\dots ,x_n]$ which is governed by the combinatorics of packed words. We relate our quotient $S_n$ to the generalized coinvariant rings of Haglund, Rhoades, and Shimozono as well as the superspace coinvariant ring.     

Permutation trinomials over Fq3

We consider four classes of polynomials over the fields ${\mathbb{F}}_{q^3}$, $q=p^h$, $p>3$, $f_1(x)=x^{q^2+q-1}+A{x}^{q^2-q+1}+Bx$, $f_2(x)=x^{q^2+q-1}+A{x}^{q^3-q^2+q}+Bx$, $f_3(x)=x^{q^2+q-1}+A{x}^{q^2}-Bx$, $f_4(x)=x^{q^2+q-1}+A{x}^q-Bx$, where $A,B\in {\mathbb{F}}_q$. We find sufficient conditions on the pairs $(A,B)$ for which these polynomials permute ${\mathbb{F}}_{q^3}$ and we give lower bounds on the number of such pairs.     

On certain linearized polynomials with high degree and kernel of small dimension

Let f be the ${\mathbb{F}}_q$-linear map over ${\mathbb{F}}_{q^{2n}}$ defined by $x?x+a{x}^{q^s}+b{x}^{q^{n+s}}$ with $\gcd ?(n,s)=1$. It is known that the kernel of f has dimension at most 2, as proved by Csajbók et al. in [9]. For n big enough, e.g. $n\ge 5$ when $s=1$, we classify the values of $b/a$ such that the kernel of f has dimension at most 1. To this aim, we translate the problem into the study of some algebraic curves of small degree with respect to the degree of f; this allows to use intersection theory and function field theory together with the Hasse-Weil bound. Our result implies a non-scatteredness result for certain high degree scattered binomials, and the asymptotic classification of a family of rank metric codes.