Several classes of optimal p-ary cyclic codes with minimum distance four

DOI10.1016/J.FFA.2023.102275arXiv2208.14404OpenAlexW4386181554MaRDI QIDQ6063232FDOQ6063232

Authors: Gaofei Wu, Huan Liu, Yuqing Zhang 

Publication date: 7 November 2023

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Abstract: Cyclic codes are a subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics due to their efficient encoding and decoding algorithms. Let $pge5$ be an odd prime and $m$ be a positive integer. Let $mathcal{C}_{(1,e,s)}$ denote the $p$-ary cyclic code with three nonzeros $alpha$, $alph{a}^e$, and $alph{a}^s$, where $alpha$ is a generator of ${mathbbF}_{p^m}^{\ast }$, $s=frac{p}^m-12$, and $2leele{p}^m-2$. In this paper, we present four classes of optimal $p$-ary cyclic codes $mathcal{C}_{(1,e,s)}$ with parameters $[p^m-1,p^m-2m-2,4]$ by analyzing the solutions of certain polynomials over finite fields. Some previous results about optimal quinary cyclic codes with parameters $[5^m-1,5^m-2m-2,4]$ are special cases of our constructions. In addition, by analyzing the irreducible factors of certain polynomials over ${mathbbF}_{5^m}$, we present two classes of optimal quinary cyclic codes $mathcal{C}_{(1,e,s)}$.

Full work available at URL: https://arxiv.org/abs/2208.14404

Recommendations

• Optimal \(p\)-ary cyclic codes with minimum distance four from monomials
• Several classes of optimal ternary cyclic codes with minimal distance four
• Several new classes of optimal ternary cyclic codes with minimum distance four
• New classes of optimal ternary cyclic codes with minimum distance four
• Two families of optimal ternary cyclic codes with minimal distance four
• Optimal ternary cyclic codes with minimum distance four and five
• scientific article; zbMATH DE number 1932292
• Some results on the minimum distance structure of cyclic codes
• On the minimum distance of cyclic codes
• scientific article; zbMATH DE number 1498821

zbMATH Keywords

minimum distancefinite fieldlinear codecyclic

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15) Equations in general fields (12E12)

Cites Work

• Title not available (Why is that?)
• Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
• Title not available (Why is that?)
• A class of three-weight cyclic codes
• Several classes of optimal ternary cyclic codes with minimal distance four
• Optimal ternary cyclic codes with minimum distance four and five
• Five Families of Three-Weight Ternary Cyclic Codes and Their Duals
• Optimal Ternary Cyclic Codes From Monomials
• New classes of optimal ternary cyclic codes with minimum distance four
• Two families of optimal ternary cyclic codes with minimal distance four
• Optimal \(p\)-ary cyclic codes with minimum distance four from monomials
• Optimal Cyclic Codes With Generalized Niho-Type Zeros and the Weight Distribution
• Further results on optimal ternary cyclic codes
• On some conjectures about optimal ternary cyclic codes
• A class of optimal ternary cyclic codes and their duals
• A family of optimal ternary cyclic codes from the Niho-type exponent
• On an open problem about a class of optimal ternary cyclic codes
• Two classes of new optimal ternary cyclic codes

Cited In (2)

• Optimal \(p\)-ary cyclic codes with minimum distance four from monomials
• Optimal quinary cyclic codes with three zeros

This page was built for publication: Several classes of optimal \(p\)-ary cyclic codes with minimum distance four

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6063232)