Two families of optimal ternary cyclic codes with two zeros

preprint OA: closed
📄 Open PDF View at publisher
AI-generated summary by claude@2026-07, 2026-07-17

This paper constructs two families of optimal ternary cyclic codes with parameters $[3^m-1,3^m-2m-1,4]$ using multivariate methods and analyzing irreducible factors of polynomials.

One-sentence paraphrase of the abstract; not a substitute for reading it. No clinical advice. How this works

Abstract

Cyclic code is an interesting topic in coding theory and communication systems. In this paper, two families of optimal ternary cyclic codes with parameters $[3^m-1,3^m-2m-1,4]$ are presented. The first family of cyclic codes with two zeros $\pi$ and $\pi^v$ is constructed by using multivariate method. The second family of cyclic codes with two zeros $\pi^2$ and $\pi^v$ is obtained by analyzing irreducible factors of certain polynomials with finite degrees over the finite field $\mathbb{F}_{3^m}$, where $\pi$ is a generator of $\mathbb{F}_{3^m}^*$.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00
unpaywall
last seen: 2026-06-13T06:42:57.164913+00:00