2000 character limit reached
Optimal quinary cyclic codes with minimum distance four
Published 28 Jun 2017 in cs.IT and math.IT | (1706.09188v2)
Abstract: In this paper, by analyzing solutions of certain equations in the finite field $\mathbb{F}_{5m}$, three classes of new optimal quinary cyclic codes with parameters $[5m-1,5m-2m-2,4]$ and two theorems are presented. With the help of the two theorems, perfect nonlinear monomials, almost perfect nonlinear monomials and a number of other monomials are used to construct more classes of new optimal quinary cyclic codes with the same parameters.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.