scientific article; zbMATH DE number 2040937
From MaRDI portal
Publication:4452086
Recommendations
Cited in
(62)- Linear codes from weakly regular plateaued functions and their secret sharing schemes
- Yet another variation on minimal linear codes
- The optimal linear secret sharing scheme for any given access structure
- Secret sharing with linear codes
- A novel secret sharing scheme based on minimal linear codes
- Variations on minimal linear codes
- Secret sharing schemes based on the dual of Golay codes
- MacDonald codes over the ring \(\mathbb{F}_p + v\mathbb{F}_p + v^2\mathbb{F}_p\)
- Two-weight and three-weight linear codes constructed from Weil sums
- Minimal linear codes from weakly regular bent functions
- Minimal linear codes from defining sets over \(\mathbb{F}_p + u \mathbb{F}_p\)
- Weight enumerators of a class of linear codes
- Minimal linear codes constructed from partial spreads
- Minimal linear codes derived from weakly regular bent and plateaued functions
- Few-weight codes from trace codes over a local ring
- Linear codes from simplicial complexes
- Two families of few-weight codes over a finite chain ring
- A family of linear codes from constant dimension subspace codes
- 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\)
- Minimal linear codes from Maiorana-McFarland functions
- Optimal non-projective linear codes constructed from down-sets
- Optimal minimal linear codes from posets
- Minimal linear codes from weakly regular plateaued balanced functions
- On the minimum number of minimal codewords
- Secret sharing schemes based on graphical codes
- Minimal binary linear codes: a general framework based on bent concatenation
- Several classes of new weakly regular bent functions outside \(\mathcal{RF}\), their duals and some related (minimal) codes with few weights
- Minimal linear codes constructed from functions
- Characterization of some minimal codes for secret sharing
- Minimal linear codes arising from blocking sets
- Construction of two- or three-weight binary linear codes from Vasil'ev codes
- New classes of binary few weight codes from trace codes over a chain ring
- FEW-WEIGHT CODES FROM TRACE CODES OVER
- A construction of q-ary linear codes with irreducible cyclic codes
- On proper secrets, (t,k)-bases and linear codes
- Five-weight codes from three-valued correlation of M-sequences
- On the maximum number of minimal codewords
- Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
- Ideal access structures based on a class of minimal linear codes
- Optimal codes from Fibonacci polynomials and secret sharing schemes
- A family of projective two-weight linear codes
- Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions
- Secret sharing schemes from binary linear codes
- Five classes of optimal two-weight linear codes
- Subfield codes of \(C_D\)-codes over \(\mathbb{F}_2 [x] / \langle x^3 - x \rangle\)
- Additive codes with few weights
- Some hypersurfaces over finite fields, minimal codes and secret sharing schemes
- Weight distributions of Q2DC codes over finite fields
- Minimal linear codes constructed from hierarchical posets with two levels
- Construction of minimal linear codes with few weights from weakly regular plateaued functions
- An inductive construction of minimal codes
- New classes of \(p\)-ary few weight codes
- A family of distance-optimal minimal linear codes with flexible parameters
- 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
- Secret sharing schemes from three classes of linear codes
- Optimal binary codes from trace codes over a non-chain ring
- Secret sharing schemes based on additive codes over \(\mathrm{GF}(4)\)
- A new secret sharing scheme
- A linear code based on resilient Boolean maps whose dual is a platform for a robust secret sharing scheme
- Linear codes with eight weights over \(\mathbb{F}_p+u\mathbb{F}_p\)
- Secret sharing schemes for compartmented access structures
- Two and three weight codes over \(\mathbb {F}_p+u\mathbb {F}_p\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452086)
