Related papers: Extended Irreducible Binary Sextic Goppa codes

We investigate $k$-superirreducible polynomials, by which we mean irreducible polynomials that remain irreducible under any polynomial substitution of positive degree at most $k$. Let $\mathbb F$ be a finite field of characteristic $p$. We…

Goppa codes form an important class of alternant codes with wide applications in algebraic coding theory and code-based cryptography. Determining the true minimum distance of a Goppa code is a difficult problem. In this paper, we provide a…

Let $\lambda(G)$ be the maximum number of subgroups in an irredundant covering of the finite group $G$. We prove that if $G$ is a group with $\lambda(G) \leqslant 6$, then $G$ is supersolvable. We also describe the structure of the groups…

Under mild conditions on $n,p$, we give a lower bound on the number of $n$-variable balanced symmetric polynomials over finite fields $GF(p)$, where $p$ is a prime number. The existence of nonlinear balanced symmetric polynomials is an…

We give an upper bound for the norm of the determinant of additively indecomposable, totally positive definite quadratic forms defined over the ring of integers of totally real number fields. We apply these results to find lower and upper…

Let $\MP_d$ denote the space of polynomials $f: \C \to \C$ of degree $d\geq 2$, modulo conjugation by $\Aut(\C)$. Using properties of polynomial trees (as introduced in [DM, math.DS/0608759]), we show that if $f_n$ is a divergent sequence…

For n=1,2,3,... let N_n(q) denote the number of monic irreducible polynomials over the finite field F_q. We mainly show that the sequence N_n(q)^{1/n} (n>e^{3+7/(q-1)^2}) is strictly increasing and the sequence…

A dominating set on an $n $-dimensional hypercube is equivalent to a binary covering code of length $n $ and covering radius 1. It is still an open problem to determine the domination number $\gamma(Q_n)$ for $ n\geq10$ and $…

In this paper, we introduce generalized extended Hamming codes over Galois rings $GR(2^n,m)$ of characteristic $2^n$ with extension degree $m$. Furthermore we prove that the minimum Hamming weight of generalized extended Hamming codes over…

Every finite group $G$ has a normal series each of whose factors either is soluble or is a direct product of nonabelian simple groups. We define the nonsoluble length $\lambda (G)$ as the minimum number of nonsoluble factors in a series of…

In this paper, we calculate the space $Ext^1_{GL(n)}(L_n(\lambda),L_n(\mu))$, where GL(n) is the general linear group of degree $n$ over an algebraically closed field of positive characteristic, $L_n(\lambda)$ and $L_n(\mu)$ are rational…

For integers $a_0,a_1,\ldots,a_n$ with $|a_0a_n|=1$ and either $\alpha =u$ with $1\leq u \leq 50$ or $\alpha=u+ \frac{1}{2}$ with $1 \leq u \leq 45$, we prove that $\psi_n^{(\alpha)}(x;a_0,a_1,\cdots,a_n)$ is irreducible except for an…

By establishing an improved level of distribution we study almost primes of the form $f(p,n)$ where $f$ is an irreducible binary form over $\mathbb Z$.

Let G be a simple, simply connected algebraic group defined over an algebraically closed field k of positive characteristic p. Let \sigma:G->G be a strict endomorphism (i. e., the subgroup G(\sigma) of \sigma-fixed points is finite). Also,…

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we enumerate self-reciprocal irreducible monic polynomials over a finite field with prescribed leading coefficients.…

Let $F_q$ be a finite field of characteristic $p=2,3$. We give the number of irreducible polynomials $x^m+a_{m-1}x^{m-1}+...+a_0\in\F_q[x]$ with $a_{m-1}$ and $a_{m-3}$ prescribed for any given $m$ if $p=2$, and with $a_{m-1}$ and $a_1$…

In this article, we consider polynomials of the form $f(x)=a_0+a_{n_1}x^{n_1}+a_{n_2}x^{n_2}+\dots+a_{n_r}x^{n_r}\in \mathbb{Z}[x],$ where $|a_0|\ge |a_{n_1}|+\dots+|a_{n_r}|,$ $|a_0|$ is a prime power and $|a_0|\nmid |a_{n_1}a_{n_r}|$. We…

Let $p$ be a prime and let $\mathbb{C}$ be the complex field. We explicitly classify the finite solvable irreducible monomial subgroups of $\mathrm{GL}(p,\mathbb{C})$ up to conjugacy. That is, we give a complete and irredundant list of…

For nonnegative integers $n,d,w$, let $A(n,d,w)$ be the maximum size of a code $C \subseteq \mathbb{F}_2^n$ with constant weight $w$ and minimum distance at least $d$. We consider two semidefinite programs based on quadruples of code words…

We consider the irreducibility of Generalised Laguerre Polynomials for negative integral values given by $L_n^{(-1-n-s)}(x)=\displaystyle\sum_{j=0}^{n}\binom{n-j+s}{n-j}\frac{x^j}{j!}.$ For different values of $s,$ this family gives…