Related papers: Galois Hulls of Linear Codes over Finite Fields

Let $X$ be a variety (possibly non-complete or singular) over a finitely generated field $k$ of characteristic $0$. For a prime number $\ell$, let $\rho_\ell$ be the Galois representation on the first $\ell$-adic cohomology of $X$. We show…

Given an irreducible bivariate polynomial $f(t,x)\in \mathbb{Q}[t,x]$, what groups $H$ appear as the Galois group of $f(t_0,x)$ for infinitely many $t_0\in \mathbb{Q}$? How often does a group $H$ as above appear as the Galois group of…

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 $K_a$ of the…

The $\ell$-adic Galois polylogarithm is an arithmetic function on an absolute Galois group with values in $\ell$-adic numbers, which arises from Galois actions on $\ell$-adic \'etale paths on ${\mathbb P}^1 \backslash \{0,1,\infty\}$. In…

Skew polynomial rings over finite fields ([7] and [10]) and over Galois rings ([8]) have been used to study codes. In this paper, we extend this concept to finite chain rings. Properties of skew constacyclic codes generated by monic right…

In this work, we study and determine the dimensions of Euclidean and Hermitian hulls of two classical propagation rules, namely, the direct sum construction and the $(\mathbf{u},\mathbf{u+v})$-construction. Some new criteria for the…

In this paper, we study Euclidean and Hermitian hulls of generalized Reed-Solomon codes and twisted generalized Reed-Solomon codes, as well as the Hermitian hulls of Roth-Lempel typed codes. We present explicit constructions of MDS and AMDS…

The projective general linear group $\mathrm{PGL}_2(\mathrm{GF}(2^m))$ acts as a $3$-transitive permutation group on the set of points of the projective line. The first objective of this paper is to prove that all linear codes over…

Self-dual codes over finite fields and over some finite rings have been of interest and extensively studied due to their nice algebraic structures and wide applications. Recently, characterization and enumeration of Euclidean self-dual…

A binary linear code is called {\em LCD} if it intersects its dual trivially. We show that the coefficients of the joint weight enumerator of such a code with its dual satisfy linear constraints, leading to a new linear programming bound on…

In this paper, we establish the modularity of every elliptic curve $E/F$, where $F$ runs over infinitely many imaginary quadratic fields, including $\mathbb{Q}(\sqrt{-d})$ for $d=1,2,3,5$. More precisely, let $F$ be imaginary quadratic and…

Let E be a CM number field, F its maximal totally real subfield, c the generator of Gal(E/F), p an odd prime totally split in E, and S a finite set of places of E containing the places above p. Let r : G_{E,S} --> GL_3(F_p^bar) be a…

Galois self-orthogonal (SO) codes are generalizations of Euclidean and Hermitian SO codes. Algebraic geometry (AG) codes are the first known class of linear codes exceeding the Gilbert-Varshamov bound. Both of them have attracted much…

In this paper, we introduce code distances, a new family of invariants for linear codes. We establish some properties and prove bounds on the code distances, and show that they are not invariants of the matroid (for a linear block code) or…

Let $\mathbb{Z}_4$ denote the ring of integers modulo $4$. The Galois ring GR$(4,m)$, which consists of $4^m$ elements, represents the Galois extension of degree $m$ over $\mathbb{Z}_4$. The constructions of codes over $\mathbb{Z}_4$ have…

The Permutation Equivalence Problem (PEP) for linear codes is a fundamental problem in coding theory and cryptography. A recent reduction shows that PEP for Linear Complementary Dual (LCD) codes reduces to Graph Isomorphism (GI) via…

It is proved that a code $L(q)$ which is monomially equivalent to the Pless symmetry code $C(q)$ of length $2q+2$ contains the (0,1)-incidence matrix of a Hadamard 3-$(2q+2,q+1,(q-1)/2)$ design $D(q)$ associated with a Paley-Hadamard matrix…

Let $K=Q(\sqrt{-\ell})$ be an imaginary quadratic field with ring of integers $\O_K$, where $\ell$ is a square free integer such that $\ell\equiv 3 \mod 4$ and $C=[n, k]$ be a linear code defined over $\O_K/2\O_K$. The level $\ell$ theta…

We introduce the notion of quadratic hull of a linear code, and give some of its properties. We then show that any symmetric bilinear multiplication algorithm for a finite-dimensional algebra over a field can be obtained by…

For any positive integers $m$ and $k$, existing literature only determines the number of all Euclidean self-dual cyclic codes of length $2^k$ over the Galois ring ${\rm GR}(4,m)$, such as in [Des. Codes Cryptogr. (2012) 63:105--112]. Using…