Evaluation of the Hamming weights of a class of linear codes based on Gauss sums
From MaRDI portal
(Redirected from Publication:522205)
Abstract: Linear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of -ary linear codes under some certain conditions, where is a power of a prime. The lower bound of its minimum Hamming distance is obtained. In some special cases, we evaluate the weight distributions of the linear codes by semi-primitive Gauss sums and obtain some one-weight, two-weight linear codes. It is quite interesting that we find new optimal codes achieving some bounds on linear codes. The linear codes in this paper can be used in secret sharing schemes, authentication codes and data storage systems.
Recommendations
Cites work
- scientific article; zbMATH DE number 3756556 (Why is no real title available?)
- scientific article; zbMATH DE number 1131801 (Why is no real title available?)
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field
- A class of three-weight and five-weight linear codes
- A coding theory construction of new systematic authentication codes
- A construction of binary linear codes from Boolean functions
- A critical review and some remarks about one- and two-weight irreducible cyclic codes
- Almost MDS codes
- Complete weight enumerators of some linear codes and their applications
- Cyclotomic Linear Codes of Order $3$
- Five Families of Three-Weight Ternary Cyclic Codes and Their Duals
- Hamming weights in irreducible cyclic codes
- How to share a secret
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Linear Codes From Some 2-Designs
- Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
- Linear codes from a generic construction
- Linear codes with two or three weights from quadratic bent functions
- Searching for linear codes with large minimum distance
- Secret sharing schemes from three classes of linear codes
- Several Classes of Cyclic Codes With Either Optimal Three Weights or a Few Weights
- The weight distributions of a class of cyclic codes
- Two classes of two-weight linear codes
- Two-Weight Codes Punctured from Irreducible Cyclic Codes
- Two-weight codes, partial geometries and Steiner systems
- Weight distributions of cyclic codes with respect to pairwise coprime order elements
- Weights of irreducible cyclic codes
- Weights of linear codes and strongly regular normed spaces
Cited in
(24)- Two new classes of projective two-weight linear codes
- A class of linear codes with two weights or three weights from some planar functions
- A construction of q-ary linear codes with two weights
- Linear codes from vectorial Boolean power functions
- Constructions of several classes of linear codes with a few weights
- Four classes of linear codes from cyclotomic cosets
- Several classes of \(p\)-ary linear codes with few weights
- At most three-weight binary linear codes from generalized Moisio's exponential sums
- An infinite family of Griesmer quasi-cyclic self-orthogonal codes
- Constructions of linear codes with two or three weights from vectorial dual-bent functions
- The values of two classes of Gaussian periods in index 2 case and weight distributions of linear codes
- Complete weight enumerators of a class of linear codes with four or five weights
- Weight distributions of two classes of linear codes with five or six weights
- Several classes of new projective three-weight or four-weight linear codes and their applications in \(s\)-sum sets
- Recent results and problems on constructions of linear codes from cryptographic functions
- A family of projective two-weight linear codes
- The punctured codes of two classes of cyclic codes with few weights
- Three new constructions of optimal linear codes with few weights
- The subfield codes of several classes of linear codes
- Several classes of linear codes with few weights from the closed butterfly structure
- A class of two or three weights linear codes and their complete weight enumerators
- Optimal binary linear codes from posets of the disjoint union of two chains
- Several classes of linear codes and their weight distributions
- New linear codes with few weights derived from Kloosterman sums
This page was built for publication: Evaluation of the Hamming weights of a class of linear codes based on Gauss sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q522205)
