A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field

DOI10.1016/J.FFA.2016.07.001zbMATH Open1364.94662arXiv1508.05077OpenAlexW2964114122MaRDI QIDQ324261FDOQ324261

Gerardo Vega

Publication date: 10 October 2016

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

Abstract: It is well known that the problem of determining the weight distributions of families of cyclic codes is, in general, notoriously difficult. An even harder problem is to find characterizations of families of cyclic codes in terms of their weight distributions. On the other hand, it is also well known that cyclic codes with few weights have a great practical importance in coding theory and cryptography. In particular, cyclic codes having three nonzero weights have been studied by several authors, however, most of these efforts focused on cyclic codes over a prime field. In this work we present a characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field. The codes under this characterization are, indeed, optimal in the sense that their lengths reach the Griesmer lower bound for linear codes. Consequently, these codes reach, simultaneously, the best possible coding capacity, and also the best possible capabilities of error detection and correction for linear codes. But because they are cyclic in nature, they also possess a rich algebraic structure that can be utilized in a variety of ways, particularly, in the design of very efficient coding and decoding algorithms. What is also worth pointing out, is the simplicity of the necessary and sufficient numerical conditions that characterize our class of optimal three-weight cyclic codes. As we already pointed out, it is a hard problem to find this kind of characterizations. However, for this particular case the fundamental tool that allowed us to find our characterization was the characterization for all two-weight irreducible cyclic codes that was introduced by B. Schmidt and C. White (2002). Lastly, another feature about the codes in this class, is that their duals seem to have always the same parameters as the best known linear codes.

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

Recommendations

• An extended characterization of a class of optimal three-weight cyclic codes over any finite field
• Some new classes of cyclic codes with three or six weights
• The weight distributions of some cyclic codes with three or four nonzeros over \(\mathbb F_3\)
• The complete weight distribution of a subclass of optimal three-weight cyclic codes
• A class of three-weight cyclic codes

zbMATH Keywords

cyclic codesweight distributionGaussian sumsGriesmer lower bound

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15) Exponential sums (11T23)

Cites Work

• All two-weight irreducible cyclic codes?
• The Weight Distribution of Some Irreducible Cyclic Codes
• Determining the Number of One-Weight Cyclic Codes When Length and Dimension Are Given
• Fundamentals of Error-Correcting Codes
• Algebraically punctured cyclic codes
• A Bound for Error-Correcting Codes
• The weight distribution of a class of linear codes from perfect nonlinear functions
• A class of three-weight cyclic codes
• The Weight Distributions of Several Classes of Cyclic Codes From APN Monomials
• Weight distributions of cyclic codes with respect to pairwise coprime order elements
• On subfield subcodes of modified Reed-Solomon codes (Corresp.)
• Two-weight cyclic codes constructed as the direct sum of two one-weight cyclic codes
• A critical review and some remarks about one- and two-weight irreducible cyclic codes
• A Characterization of Two-Weight Projective Cyclic Codes
• Three-weight cyclic codes and their weight distributions

Cited In (12)

• The weight distributions of a class of cyclic codes with three nonzeros over \(\mathbb{F}_3\)
• A unified construction of optimal and distance optimal two or three-weight codes
• Vectorial bent functions and linear codes from quadratic forms
• Hamming weight enumerators of multi-twisted codes with at most two non-zero constituents
• Optimal pseudo-cyclic codes and caps in \(PG(3,q)\)
• The weight distribution of a class of cyclic codes containing a subclass with optimal parameters
• The subfield and extended codes of a subclass of optimal three-weight cyclic codes
• On the subfield codes of a subclass of optimal cyclic codes and their covering structures
• An extended characterization of a class of optimal three-weight cyclic codes over any finite field
• Hamming weight distributions of multi-twisted codes over finite fields
• The complete weight distribution of a subclass of optimal three-weight cyclic codes
• Evaluation of the Hamming weights of a class of linear codes based on Gauss sums

This page was built for publication: A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field

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