Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
From MaRDI portal
Abstract: Linear codes with few weights have applications in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs. This paper first generalizes the method of constructing two-weight and three-weight linear codes of Ding et al. cite{DD2015} and Zhou et al. cite{ZLFH2015} to general weakly regular bent functions and determines the weight distributions of these linear codes. It solves the open problem of Ding et al. cite{DD2015}. Further, this paper constructs new linear codes with two or three weights and presents the weight distributions of these codes. They contains some optimal codes meeting certain bound on linear codes.
Cited in
(only showing first 100 items - show all)- Three-weight codes and near-bent functions from two-weight codes
- Two classes of linear codes and their weight distributions
- Complete weight enumerators of three classes of linear codes
- Five classes of optimal two-weight linear codes
- Complete weight enumerators of a class of linear codes with two weights
- Binary linear codes with two or three weights from Niho exponents
- Some two-weight and three-weight linear codes
- Linear codes from weakly regular plateaued functions and their secret sharing schemes
- A link between combinatorial designs and three-weight linear codes
- Several infinite families of \(p\)-ary weakly regular bent functions
- Complete weight enumerators for several classes of two-weight and three-weight linear codes
- Projective binary linear codes from special Boolean functions
- More constructions of 3-weight linear codes
- Linear codes from vectorial Boolean power functions
- A class of two or three weights linear codes and their complete weight enumerators
- A construction of p-ary linear codes with two or three weights
- Construction of minimal linear codes from multi-variable functions
- Two classes of near-optimal codebooks with respect to the Welch bound
- Wide minimal binary linear codes from the general Maiorana-Mcfarland class
- Recent results and problems on constructions of linear codes from cryptographic functions
- Two families of subfield codes with a few weights
- A family of projective two-weight linear codes
- Binary linear codes with few weights from Boolean functions
- Characterization of \(p\)-ary functions in terms of association schemes and its applications
- Infinite families of optimal linear codes and their applications to distributed storage systems
- Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound
- Minimal linear codes from weakly regular bent functions
- Minimal linear codes constructed from functions
- Constructions of projective linear codes by the intersection and difference of sets
- Linear codes with few weights from cyclotomic classes and weakly regular bent functions
- Minimal linear codes from Maiorana-McFarland functions
- A note on the minimal binary linear code
- On generalized hyper-bent functions
- A family of distance-optimal minimal linear codes with flexible parameters
- Minimal linear codes from weakly regular plateaued balanced functions
- Linear codes with few weights from weakly regular plateaued functions
- Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions
- Ramanujan graphs and expander families constructed from \(p\)-ary bent functions
- Complete weight enumerators of a class of linear codes with two or three weights
- A construction of linear codes and strongly regular graphs from \(q\)-polynomials
- Three-weight ternary linear codes from a family of power functions
- A construction of several classes of two-weight and three-weight linear codes
- A construction of q-ary linear codes with irreducible cyclic codes
- Two-weight and three-weight linear codes based on Weil sums
- A survey on the applications of Niho exponents
- The parameters of minimal linear codes
- Constructing few-weight linear codes and strongly regular graphs
- New results on vectorial dual-bent functions and partial difference sets
- Further projective binary linear codes derived from two-to-one functions and their duals
- Two new classes of projective two-weight linear codes
- Complete weight enumerators of some classes of linear codes with a few weights
- A construction of codes with linearity from two linear codes
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- A class of linear codes with a few weights
- Two classes of p-ary bent functions and linear codes with three or four weights
- A class of three-weight linear codes and their complete weight enumerators
- Type IV-II codes over \(\mathbb{Z}_4\) constructed from generalized bent functions
- Three classes of binary linear codes with good parameters
- Construction of minimal linear codes with few weights from weakly regular plateaued functions
- A class of hyper-bent functions and Kloosterman sums
- Linear codes with few weights from inhomogeneous quadratic functions
- Evaluation of the Hamming weights of a class of linear codes based on Gauss sums
- Complete weight enumerators of a class of linear codes
- Constructions of linear codes with two or three weights from vectorial dual-bent functions
- Several classes of new weakly regular bent functions outside \(\mathcal{RF}\), their duals and some related (minimal) codes with few weights
- Hybrid character sums and near-optimal partial Hadamard codebooks
- Three families of self-orthogonal codes and their application in optimal quantum codes
- Several classes of linear codes with few weights over finite fields
- Ternary self-orthogonal codes from weakly regular bent functions and their application in LCD codes
- Three new constructions of optimal linear codes with few weights
- Vectorial bent functions and linear codes from quadratic forms
- Infinite families of \(t\)-designs and strongly regular graphs from punctured codes
- The punctured codes of two classes of cyclic codes with few weights
- Generalized Hamming weights of linear codes from cryptographic functions
- Some shortened codes from linear codes constructed by defining sets
- Connection of p-ary t-weight linear codes to Ramanujan Cayley graphs with t+1 eigenvalues
- Several classes of p-ary linear codes with few weights
- Some 3-designs and shortened codes from binary cyclic codes with three zeros
- Some subfield codes from MDS codes
- Several classes of permutation polynomials based on the AGW criterion over the finite field \(\mathbb{F}_{2^{2m}}\)
- Constructions of strongly regular Cayley graphs derived from weakly regular bent functions
- A class of three-weight linear codes over finite fields of odd characteristic
- Construction of self-orthogonal $$\mathbb {Z}_{2^k}$$-codes
- Constructions for several classes of few-weight linear codes and their applications
- Several classes of new projective three-weight or four-weight linear codes and their applications in s-sum sets
- Characterization of weakly regular \(p\)-ary bent functions of \(\ell \)-form
- Few-weight linear codes over \(\mathbb{F}_p\) from \(t\)-to-one mappings
- Combinatorial t-designs and strongly regular graphs from projective codes over finite fields
- Additive codes with few weights
- Minimal linear codes constructed from hierarchical posets with two levels
- Association schemes arising from non-weakly regular bent functions
- Linear codes from planar functions and related covering codes
- Linear codes from quadratic forms
- Four classes of wide minimal q-ary linear codes from a general method
- Weight enumerators of a class of linear codes
- Optimal few-weight codes from projective spaces
- Constructions of binary quantum CSS-T codes from some special functions
- Several classes of three-weight and four-weight linear codes
- Minimal codes derived from plateaued functions over \(\mathbb{F}_5\)
- A family of optimal dual-containing and reversible linear codes over \(\mathbb{F}_4\)
This page was built for publication: Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976952)
