Related papers: Galois Hulls of Linear Codes over Finite Fields

Commonly the direct construction and the description of mutually orthogonal Latin squares (MOLS) makes use of difference or quasi-difference matrices. Now there exists a correspondence between MOLS and separable permutation codes. We like…

We study normal extensions with Galois group Hol($C_8$) that are unramified over a complex quadratic subfield. The Galois group is either the semi-dihedral group or the modular group of order $16$. We present an explicit construction of…

Linear complementary dual codes (LCD) intersect trivially with their dual. In this paper, we develop a new characterization for LCD codes, which allows us to judge the complementary duality of linear codes from the codeword level. Further,…

In this paper, we shall study k-Galois LCD constacyclic group codes over finite commutative chain rings with identity. In particular, we shall characterize Galois LCD constacyclic codes over finite commutative chain ring with identity in…

In the 80's Aschbacher classified the maximal subgroups of almost all of the finite almost simple classical groups. Essentially, this classification divide these subgroups into two types. The first of these consist roughly of subgroups that…

In his previous paper (Math. Res. Letters 7(2000), 123--132) the author proved that in characteristic zero the jacobian $J(C)$ of a hyperelliptic curve $C: y^2=f(x)$ has only trivial endomorphisms over an algebraic closure of the ground…

The Galois group of a family of cubic surfaces is the monodromy group of the 27 lines of its generic fibre. We describe a method to compute this group for linear systems of cubic surfaces using certified numerical computations. Applying…

A linear code of length $n$ over a finite chain ring $R$ with residue field $\F_q$ is a $R$-submodule of $R^n$. A $R$-linear code is a code over $\F_q$ (not necessarily linear) which is the generalized Gray map image of a linear code over…

Let $\mathbb{F}_q$ be a finite field with $q$ elements and denote by $\theta : \mathbb{F}_q\to\mathbb{F}_q$ an automorphism of $\mathbb{F}_q$. In this paper, we deal with linear codes of $\mathbb{F}_q^n$ invariant under a semi-linear map…

Let E be an elliptic curve without complex multiplication (CM) over a number field K, and let G_E(ell) be the image of the Galois representation induced by the action of the absolute Galois group of K on the ell-torsion subgroup of E. We…

Let $F$ be a non-archimedean local field of characteristic different from 2 and residual characteristic $p$. This paper concerns the $\ell$-modular representations of a connected reductive group $G$ distinguished by a Galois involution,…

In this paper, we consider mod $\ell$ Galois representations of $\mathbb{Q}$. In particular, we obtain an effective criterion to distinguish two semisimple 2-dimensional, odd mod $\ell$ Galois representations up to isomorphism. Serre's…

A linear code $C$ over $\mathbb{F}_q$ is called $\Delta$-divisible if the Hamming weights $\operatorname{wt}(c)$ of all codewords $c \in C$ are divisible by $\Delta$. The possible effective lengths of $q^r$-divisible codes have been…

The hull of linear codes have promising utilization in coding theory and quantum coding theory. In this paper, we study the hull of generalized Reed-Solomon codes and extended generalized Reed-Solomon codes over finite fields with respect…

We give two new characterizations of ($\F_2$-linear) locally testable error-correcting codes in terms of Cayley graphs over $\F_2^h$: \begin{enumerate} \item A locally testable code is equivalent to a Cayley graph over $\F_2^h$ whose set of…

It is proved in a reference (Fan, Lin, IEEE TIT, vol.67, pp.5016-5025) that the self-dual (LCD respectively) dihedral codes over a finite field~$F$ with ${|F|=q}$ are asymptotically good if $q$ is even (odd respectively). In this paper, we…

The global Langlands conjecture for $\text{GL}_n$ over a number field $F$ predicts a correspondence between certain algebraic automorphic representations $\pi$ of $\text{GL}_n(\mathbb{A}_F)$ and certain families $\{ \rho_{\pi,\ell} \}_\ell$…

Let $\mathbb{F}_q$ be a finite field of order $q$, a prime power integer such that $q=et+1$ where $t\geq 1,e\geq 2$ are integers. In this paper, we study cyclic codes of length $n$ over a non-chain ring $R_{e,q}=\mathbb{F}_q[u]/\langle…

We study the Hermitian hull of a particular family of generalized Reed-Solomon codes. The problem of computing the dimension of the hull is translated to a counting problem in a lattice. By solving this problem, we provide explicit formulas…

For a given linear code $\C$ of length $n$ over $\gf(q)$ and a nonzero vector $\bu$ in $\gf(q)^n$, Sun, Ding and Chen defined an extended linear code $\overline{\C}(\bu)$ of $\C$, which is a generalisation of the classical extended code…