New linear codes with few weights derived from Kloosterman sums
From MaRDI portal
The authors, through some detailed calculations on certain exponential sums, obtain a class of optimal 1-weight binary linear codes, new classes of 2-weight and 3-weight \(p\)-ary linear codes and a class of 4-weight binary linear codes. The lengths and weight distributions of the obtained \(t\)-weight linear codes, with \(t = 1, 2, 3\), are expressed in terms of Kloosterman sums over finite prime fields. They are completely determined when \(p = 2\) and \(p = 3\).
Recommendations
- The weight distribution of a class of two-weight linear codes derived from Kloosterman sums
- Two-weight and three-weight linear codes based on Weil sums
- Weight distributions for projective binary linear codes from Weil sums
- At most three-weight binary linear codes from generalized Moisio's exponential sums
- Evaluation of the Hamming weights of a class of linear codes based on Gauss sums
Cites work
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- A coding theory construction of new systematic authentication codes
- A construction of binary linear codes from Boolean functions
- A Generic Construction of Cartesian Authentication Codes
- Bent vectorial functions and linear codes from o-polynomials
- Codes for error detection.
- Cyclotomic Linear Codes of Order 3
- Evaluation of the Hamming weights of a class of linear codes based on Gauss sums
- Fundamentals of Error-Correcting Codes
- How to build robust shared control systems
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 3871188 (Why is no real title available?)
- scientific article; zbMATH DE number 3894973 (Why is no real title available?)
- Kloosterman sums and finite field extensions
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Linear Codes From Some 2-Designs
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- Linear codes with two or three weights from quadratic bent functions
- Monomial and quadratic bent functions over the finite fields of odd characteristic
- Monomial bent functions
- Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions
- The weight distribution of a class of two-weight linear codes derived from Kloosterman sums
- Three-weight ternary linear codes from a family of cyclic difference sets
- Two classes of two-weight linear codes
Cited in
(17)- On some properties of the hyper-Kloosterman codes
- The weight distribution of a class of two-weight linear codes derived from Kloosterman sums
- On \(\mathbb{Z}_4\)-linear Goethals codes and Kloosterman sums
- At most three-weight binary linear codes from generalized Moisio's exponential sums
- Recent results and problems on constructions of linear codes from cryptographic functions
- The \(t\)-wise intersection and trellis of relative four-weight codes
- Weight distributions for projective binary linear codes from Weil sums
- The cross-correlation values of a class of sequences with different lengths
- Several classes of linear codes with few weights from the closed butterfly structure
- Three classes of binary linear codes with good parameters
- Evaluation of the Hamming weights of a class of linear codes based on Gauss sums
- Hyper-Kloosterman sums and their applications to the coding theory
- Three families of self-orthogonal codes and their application in optimal quantum codes
- Two classes of 2-weight and 3-weight linear codes in terms of Kloosterman sums
- Several classes of three-weight and four-weight linear codes
- Several classes of linear codes with AMDS duals and their subfield codes
- Linear codes from multivariate functions associated with simplicial complexes
This page was built for publication: New linear codes with few weights derived from Kloosterman sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2302568)
