Covering and secret sharing with linear codes
From MaRDI portal
Recommendations
- Secret sharing schemes from three classes of linear codes
- Secret sharing schemes from binary linear codes
- Characterization of some minimal codes for secret sharing
- The optimal linear secret sharing scheme for any given access structure
- A construction of practical secret sharing schemes using linear block codes
Cited in
(81)- Few-weight codes from trace codes over a local ring
- Five classes of optimal two-weight linear codes
- Linear codes from simplicial complexes
- Two-weight and three-weight codes from trace codes over \(\mathbb{F}_p + u \mathbb{F}_p + v \mathbb{F}_p + u v \mathbb{F}_p\)
- Optimal codes from Fibonacci polynomials and secret sharing schemes
- Optimal non-projective linear codes constructed from down-sets
- Linear codes from weakly regular plateaued functions and their secret sharing schemes
- Secret sharing schemes based on graphical codes
- Minimal linear codes arising from blocking sets
- On the maximum number of minimal codewords
- A family of projective two-weight linear codes
- A family of linear codes from constant dimension subspace codes
- Linear codes with eight weights over \(\mathbb{F}_p+u\mathbb{F}_p\)
- An inductive construction of minimal codes
- Secret sharing schemes based on the dual of Golay codes
- Minimal linear codes from weakly regular bent functions
- Minimal binary linear codes: a general framework based on bent concatenation
- New classes of binary few weight codes from trace codes over a chain ring
- Two-weight and three-weight linear codes constructed from Weil sums
- Minimal linear codes constructed from functions
- New classes of codes over \(R_{q,p,m}=\mathbb{Z}_{p^m}[u_1, u_2, \dots , u_q]/ \langle u_i^2=0,u_iu_j=u_ju_i\rangle\) and their applications
- Minimal linear codes from Maiorana-McFarland functions
- A family of distance-optimal minimal linear codes with flexible parameters
- Optimal minimal linear codes from posets
- Minimal linear codes from weakly regular plateaued balanced functions
- Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions
- A linear code based on resilient Boolean maps whose dual is a platform for a robust secret sharing scheme
- New classes of \(p\)-ary few weight codes
- MacDonald codes over the ring \(\mathbb{F}_p + v\mathbb{F}_p + v^2\mathbb{F}_p\)
- Secret sharing schemes based on additive codes over \(\mathrm{GF}(4)\)
- A construction of q-ary linear codes with irreducible cyclic codes
- The optimal linear secret sharing scheme for any given access structure
- Yet another variation on minimal linear codes
- Some hypersurfaces over finite fields, minimal codes and secret sharing schemes
- Weight distributions of Q2DC codes over finite fields
- Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
- Ideal access structures based on a class of minimal linear codes
- Variations on minimal linear codes
- Secret sharing schemes from three classes of linear codes
- FEW-WEIGHT CODES FROM TRACE CODES OVER
- Characterization of some minimal codes for secret sharing
- A novel secret sharing scheme based on minimal linear codes
- Construction of two- or three-weight binary linear codes from Vasil'ev codes
- Secret sharing with linear codes
- Optimal binary codes from trace codes over a non-chain ring
- A new secret sharing scheme
- Construction of minimal linear codes with few weights from weakly regular plateaued functions
- Secret sharing schemes for compartmented access structures
- Two and three weight codes over \(\mathbb {F}_p+u\mathbb {F}_p\)
- Two families of few-weight codes over a finite chain ring
- Several classes of new weakly regular bent functions outside \(\mathcal{RF}\), their duals and some related (minimal) codes with few weights
- On the minimum number of minimal codewords
- Five-weight codes from three-valued correlation of M-sequences
- Minimal linear codes from defining sets over \(\mathbb{F}_p + u \mathbb{F}_p\)
- Secret sharing schemes from binary linear codes
- Minimal linear codes constructed from partial spreads
- Minimal linear codes derived from weakly regular bent and plateaued functions
- Subfield codes of \(C_D\)-codes over \(\mathbb{F}_2 [x] / \langle x^3 - x \rangle\)
- Additive codes with few weights
- Minimal linear codes constructed from hierarchical posets with two levels
- Four classes of wide minimal q-ary linear codes from a general method
- Weight enumerators of a class of linear codes
- Minimal codes derived from plateaued functions over \(\mathbb{F}_5\)
- Minimal linear codes from vectorial functions
- The augmented codes of a family of linear codes with locality 2
- Two new families of linear codes with five Lee-weights over \(\mathbb{F}_q + u \mathbb{F}_q\) and their Gray images
- Characterizations for minimal codes: graph theory approach and algebraic approach over finite chain rings
- Linear codes over \(\mathbb{Z}_{p^2}\) with few-weight from down-sets
- Construction of a class of at most three-weight linear codes and the applications
- Several classes of minimal linear codes from weakly regular and non-weakly regular bent functions
- Several new classes of p-ary weakly regular plateaued functions and minimal codes with several weights
- Classification of a class of A^3MDS code and applications in secret-sharing schemes
- Several classes of minimal linear codes from vectorial Boolean functions and p-ary functions
- Binary subfield codes of codes over a certain chain ring
- Two families of \(\mathbb{Z}_{p^m}\)-linear codes and their applications
- Characterization of Plotkin-optimal two-weight codes over finite chain rings and some applications
- Binary t-divisible codes via simplicial complexes and their applications
- Hamming weight enumerators and hulls of linear codes with new parameters associated with simplicial complexes
- On proper secrets, (t,k)-bases and linear codes
- Several classes of linear codes with at most six weights and their secret sharing schemes
- On some minimal linear codes invariant under the Chevalley group \(\mathrm{F}_4(2)\)
This page was built for publication: Covering and secret sharing with linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452086)
