Related papers: Construction of Non-special Divisors on Kummer Cov…
Due to their widespread applications, linear complementary pairs (LCPs) have attracted much attention in recent years. In this paper, we determine explicit construction of non-special divisors of degree $g$ and $g-1$ on Kummer extensions…
A recent construction of linear complementary pairs (LCPs) of algebraic geometry codes is intimately linked to the identification of non-special divisors of small degree within a function field over a finite field. Let $\mathbb{F}_q$ be the…
In recent years, linear complementary pairs (LCP) of codes and linear complementary dual (LCD) codes have gained significant attention due to their applications in coding theory and cryptography. In this work, we construct explicit LCPs of…
This paper is concerned with the construction of algebraic geometric codes defined from Kummer extensions. It plays a significant role in the study of such codes to describe bases for the Riemann-Roch spaces associated with totally ramified…
Linear complementary dual (LCD) codes and linear complementary pairs (LCP) of codes have been proposed for new applications as countermeasures against side-channel attacks (SCA) and fault injection attacks (FIA) in the context of direct sum…
In this paper, we consider the hull of an algebraic geometry code, meaning the intersection of the code and its dual. We demonstrate how codes whose hulls are algebraic geometry codes may be defined using only rational places of Kummer…
For Kummer extensions defined by $y^m = f (x)$, where $f (x)$ is a separable polynomial over the finite field $\mathbb{F}_q$, we compute the number of Weierstrass gaps at two totally ramified places. For many totally ramified places we give…
For a Kummer extension defined by the affine equation $y^{m}=\prod_{i=1}^{r} (x-\a_i)^{\lambda_i}$ over an algebraic extension $K$ of a finite field $\fq$, where $\la_i\in \Z\backslash\{0\}$ for $1\leq i\leq r$, $\gcd(m,q) = 1$, and…
The Weierstrass semigroups and pure gaps can be helpful in constructing codes with better parameters. In this paper, we investigate explicitly the minimal generating set of the Weierstrass semigroups associated with several totally ramified…
Low-depth parity check (LDPC) codes are a paradigm of error correction that allow for spatially non-local interactions between (qu)bits, while still enforcing that each (qu)bit interacts only with finitely many others. On expander graphs,…
In this paper, we develop an efficient decoder via the proximal alternating direction method of multipliers (proximal-ADMM) technique for nonbinary linear block codes in the Galois field. Its main contents are as follows: first, exploiting…
We compute the Weierstrass semigroup at one totally ramified place for Kummer extensions defined by $y^m=f(x)^{\lambda}$ where $f(x)$ is a separable polynomial over $\mathbb{F}_q$. In addition, we compute the Weierstrass semigroup at two…
An additive code is an $\mathbb{F}_q$-linear subspace of $\mathbb{F}_{q^m}^n$ over $\mathbb{F}_{q^m}$, which is not a linear subspace over $\mathbb{F}_{q^m}$. Linear complementary pairs (LCP) of codes have important roles in cryptography,…
We determine the Weierstrass semigroup at one and two totally ramified places in a Kummer extension defined by the affine equation $y^{m}=\prod_{i=1}^{r} (x-\alpha_i)^{\lambda_i}$ over $K$, the algebraic closure of $\mathbb{F}_q$, where…
This paper presents explicit constructions of bases for Riemann-Roch spaces associated with arbitrary divisors on elliptic curves. In the context of algebraic geometry codes, the knowledge of an explicit basis for arbitrary divisors is…
We introduce a condition for Hopf-Galois extensions that generalizes the notion of Kummer Galois extension. Namely, an $H$-Galois extension $L/K$ is $H$-Kummer if $L$ can be generated by adjoining to $K$ a finite set $S$ of eigenvectors for…
We construct explicitly APF extensions of finite extensions of $\qp$ for which the Galois group is not a p-adic Lie group and which do not have any open subgroup with $\zp$-quotient.
Linear complementary pairs (LCP) of codes play an important role in armoring implementations against side-channel attacks and fault injection attacks. One of the most common ways to construct LCP of codes is to use Euclidean linear…
Our goal is to give a purely algebraic characterization of finite abelian Galois covers of a complete, irreducible, non-singular curve $X$ over an algebraically closed field $\k$. To achieve this, we make use of the Galois theory of…
In this paper, we devote to devise a non-binary low-density parity-check (LDPC) decoder in Galois fields of characteristic two ($\mathbb{F}_{2^q}$) via the alternating direction method of multipliers (ADMM) technique. Through the proposed…