Evaluation of the Hamming weights of a class of linear codes based on Gauss sums
From MaRDI portal
Publication:522205
DOI10.1007/S10623-016-0222-7zbMATH Open1381.94118arXiv1511.02093OpenAlexW2964329350MaRDI QIDQ522205FDOQ522205
Publication date: 13 April 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1511.02093
Recommendations
- Two-weight and three-weight linear codes based on Weil sums
- Constructions of several classes of linear codes with a few weights
- New linear codes with few weights derived from Kloosterman sums
- A construction of \(q\)-ary linear codes with two weights
- Several new classes of linear codes with few weights
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Exponential sums (11T23) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Hamming weights in irreducible cyclic codes
- Searching for linear codes with large minimum distance
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Title not available (Why is that?)
- Weights of irreducible cyclic codes
- Title not available (Why is that?)
- The weight distributions of a class of cyclic codes
- How to share a secret
- Secret sharing schemes from three classes of linear codes
- Weights of linear codes and strongly regular normed spaces
- Five Families of Three-Weight Ternary Cyclic Codes and Their Duals
- A coding theory construction of new systematic authentication codes
- Linear Codes From Some 2-Designs
- A construction of binary linear codes from Boolean functions
- Cyclotomic Linear Codes of Order $3$
- Two-Weight Codes Punctured from Irreducible Cyclic Codes
- Weight distributions of cyclic codes with respect to pairwise coprime order elements
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- Linear codes from a generic construction
- Complete weight enumerators of some linear codes and their applications
- Linear codes with two or three weights from quadratic bent functions
- Almost MDS codes
- A critical review and some remarks about one- and two-weight irreducible cyclic codes
- A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field
- Title not available (Why is that?)
- Two-weight codes, partial geometries and Steiner systems
- Two classes of two-weight linear codes
- A class of three-weight and five-weight linear codes
- Several Classes of Cyclic Codes With Either Optimal Three Weights or a Few Weights
- Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
Cited In (23)
- 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
- Several classes of \(p\)-ary linear codes with few weights
- Constructions of several classes of linear codes with a few weights
- Four classes of linear codes from cyclotomic cosets
- At most three-weight binary linear codes from generalized Moisio's exponential sums
- Constructions of linear codes with two or three weights from vectorial dual-bent functions
- An infinite family of Griesmer quasi-cyclic self-orthogonal codes
- The values of two classes of Gaussian periods in index 2 case and weight distributions of linear codes
- Several classes of new projective three-weight or four-weight linear codes and their applications in \(s\)-sum sets
- Weight distributions of two classes of linear codes with five or six weights
- 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)
