BCH and LCD cyclic codes of length $n=λ(q^m+1)$ over finite fields
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908876957286400 |
|---|---|
| author | Liu, Jinle Wu, Hongfeng Zhu, Li |
| author_facet | Liu, Jinle Wu, Hongfeng Zhu, Li |
| contents | 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$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_07688 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | BCH and LCD cyclic codes of length $n=λ(q^m+1)$ over finite fields Liu, Jinle Wu, Hongfeng Zhu, Li Information Theory 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$. |
| title | BCH and LCD cyclic codes of length $n=λ(q^m+1)$ over finite fields |
| topic | Information Theory |
| url | https://arxiv.org/abs/2603.07688 |