arXiv subjects

Jinle Liu

Publications and source records attributed to Jinle Liu.

3 recordsLinked to original sources

arXiv2026

BCH and LCD cyclic codes of length $n=λ(q^m+1)$ over finite fields

BCH and LCD cyclic codes of length $n=λ(q^m+1)$ with $λ\mid q-1$ are studied. A complete characterization of $q$-cyclotomic cosets modulo $n$ is given: Theorem \ref{th4} provides a necessary and sufficient condition for any $0\le γ<n$ to be a coset leader, and for odd $m$, the two largest coset leaders are explicitly determined (Theorem \ref{th9} and Theorem \ref{th14}). Based on these results, the dimensions of several families of BCH codes are determined, and the lower bound on the minimal distance of $\mathcal{C}_{(q,n,2δ+1,n-δ+1)}$ is raised to $2(δ+1)$ (Theorem \ref{th15}--\ref{th5}). Notably, several of these codes are optimal. When $m$ is odd, the necessary and sufficient condition for the BCH code $\mathcal{C}_{(q,n,δ,0)}$ to be dually-BCH is proved (Theorem \ref{th11}). Finally, an exact enumeration of all LCD cyclic codes of this length is derived (Theorem \ref{th3}). All of the above results extend previous results that were limited to $λ=1$.

cs.IT↗

arXiv2025

The Multiple Equal-Difference Structure of Cyclotomic Cosets

In this paper we introduce the definition of equal-difference cyclotomic coset, and prove that in general any cyclotomic coset can be decomposed into a disjoint union of equal-difference subsets. Among the equal-difference decompositions of a cyclotomic coset, an important class consists of those in the form of cyclotomic decompositions, called the multiple equal-difference representations of the coset. There is an equivalent correspondence between the multiple equal-difference representations of $q$-cyclotomic cosets modulo $n$ and the irreducible factorizations of $X^{n}-1$ in binomial form over finite extension fields of $\mathbb{F}_{q}$. We give an explicit characterization of the multiple equal-difference representations of any $q$-cyclotomic coset modulo $n$, through which a criterion for $X^{n}-1$ factoring into irreducible binomials is obtained. In addition, we present an algorithm to simplify the computation of the leaders of cyclotomic cosets.

math.NT↗

arXiv2025

Explicit Representatives and Sizes of Cyclotomic Cosets and their Application to Cyclic Codes over Finite Fields

Cyclotomic coset is a classical notion in the theory of finite field which has wide applications in various computation problems. Let $q$ be a prime power, and $n$ be a positive integer coprime to $q$. In this paper we determine explicitly the representatives and the sizes of all $q$-cyclotomic cosets modulo $n$ in the general settings. We introduce the definition of $2$-adic cyclotomic system, which is a profinite space consists of certain compatible sequences of cyclotomic cosets. A precise characterization of the structure of the $2$-adic cyclotomic system is given, which reveals the general formula for representatives of cyclotomic cosets. With the representatives and the sizes of $q$-cyclotomic cosets modulo $n$, we improve the formulas for the factorizations of $X^{n}-1$ and of $Φ_{n}(X)$ over $\mathbb{F}_{q}$ given in \cite{Graner}. As a consequence, we classify the cyclic codes over finite fields via giving their generator polynomials. Moreover, the self-dual cyclic codes are determined and enumerated.

cs.IT↗