A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
From MaRDI portal
Abstract: In this paper, a class of two-weight and three-weight linear codes over is constructed, and their application in secret sharing is investigated. Some of the linear codes obtained are optimal in the sense that they meet certain bounds on linear codes. These codes have applications also in authentication codes, association schemes, and strongly regular graphs, in addition to their applications in consumer electronics, communication and data storage systems.
Cited in
(only showing first 100 items - show all)- Secret-sharing with a class of ternary codes
- Two classes of linear codes and their weight distributions
- Few-weight codes from trace codes over a local ring
- Complete weight enumerators of three classes of linear codes
- Linear codes from simplicial complexes
- Complete weight enumerators of a class of three-weight linear codes
- Complete weight enumerators of a class of linear codes with two weights
- The weight distribution of a class of two-weight linear codes derived from Kloosterman sums
- 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
- A class of linear codes with two weights or three weights from some planar functions
- Several classes of linear codes with a few weights from defining sets over \(\mathbb {F}_p+u\mathbb {F}_p\)
- Three-weight ternary linear codes from a family of cyclic difference sets
- 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
- At most three-weight binary linear codes from generalized Moisio's exponential sums
- Constructions of several classes of linear codes with a few weights
- Constant composition codes as subcodes of linear codes
- A class of two or three weights linear codes and their complete weight enumerators
- Minimal linear codes arising from blocking sets
- A construction of p-ary linear codes with two or three weights
- A class of linear codes and their complete weight enumerators
- Complete weight enumerators of a class of linear codes over finite fields
- Construction of minimal linear codes from multi-variable functions
- Two classes of near-optimal codebooks with respect to the Welch bound
- Weight distributions and weight hierarchies of two classes of binary linear codes
- Complete weight enumerators of two classes of linear codes with a few weights
- Wide minimal binary linear codes from the general Maiorana-Mcfarland class
- Recent results and problems on constructions of linear codes from cryptographic functions
- The subfield codes of several classes of linear codes
- Two families of subfield codes with a few weights
- A class of subfield codes of linear codes and their duals
- The \(t\)-wise intersection and trellis of relative four-weight codes
- Hamming weight distributions of multi-twisted codes over finite fields
- A family of projective two-weight linear codes
- Binary linear codes with few weights from Boolean functions
- Weight hierarchies of a family of linear codes associated with degenerate quadratic forms
- A family of linear codes from constant dimension subspace codes
- Weight distributions and weight hierarchies of a family of \(p\)-ary linear codes
- Extremal solutions of an inequality concerning supports of permutation groups and punctured Hadamard codes
- Few-weight \(\mathbb{Z}_p\mathbb{Z}_p[u]\)-additive codes from down-sets
- Linear codes with eight weights over \(\mathbb{F}_p+u\mathbb{F}_p\)
- A new construction of two-, three- and few-weight codes via our GU codes and their applications
- Two-weight or three-weight binary linear codes from cyclotomic mappings
- Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound
- A class of linear codes with their complete weight enumerators over finite fields
- Weight distributions for projective binary linear codes from Weil sums
- Weight distributions of two classes of linear codes with five or six weights
- Infinite families of 2-designs from linear codes
- Two-weight and three-weight linear codes constructed from Weil sums
- Three-weight minimal linear codes
- Minimal linear codes constructed from functions
- Three-weight linear codes from Weil sums
- Constructions of projective linear codes by the intersection and difference of sets
- Minimal linear codes from Maiorana-McFarland functions
- A note on the minimal binary linear code
- 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
- Hamming weight enumerators of multi-twisted codes with at most two non-zero constituents
- Several classes of linear codes with few weights from the closed butterfly structure
- Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions
- New linear codes with few weights derived from Kloosterman sums
- Complete weight enumerators of a class of two-weight linear codes
- New classes of \(p\)-ary few weight codes
- Two-weight codes: upper bounds and new optimal constructions
- 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
- Generalized Hamming weights of three classes of linear codes
- A construction of several classes of two-weight and three-weight linear codes
- Binary linear codes from vectorial Boolean functions and their weight distribution
- A construction of q-ary linear codes with two weights
- A construction of linear codes and their complete weight enumerators
- A class of three-weight and five-weight linear codes
- Complete weight enumerator for a class of linear codes from defining sets and their applications
- Two-weight and three-weight linear codes based on Weil sums
- Three classes of linear codes with two or three weights
- Several classes of binary linear codes and their weight enumerators
- A survey on the applications of Niho exponents
- The parameters of minimal linear codes
- Constructing few-weight linear codes and strongly regular graphs
- Further projective binary linear codes derived from two-to-one functions and their duals
- A generalization of cyclic code equivalence algorithm to constacyclic codes
- Weight distributions of Q2DC codes over finite fields
- Weight distributions of generalized quasi-cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\)
- Two new classes of projective two-weight linear codes
- 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
- Complete weight enumerators of some classes of linear codes with a few weights
- Primitive idempotents in the ring \(F_4[x]/\langle x^{p^n}-1\rangle\) and cyclotomic \(Q\) codes
- FEW-WEIGHT CODES FROM TRACE CODES OVER
- 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
This page was built for publication: A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977097)
