Secret Sharing Schemes from Two-Weight Codes
From MaRDI portal
Recommendations
Cited in
(20)- Secret-sharing with a class of ternary codes
- Construction of one-Gray weight codes and two-Gray weight codes over \(\mathbb{Z}_{4} + u \mathbb{Z}_{4}\)
- On some classes of codes with a few weights
- Secret sharing schemes based on the dual of Golay codes
- Notes on generalized Hamming weights of some classes of binary codes
- The optimal linear secret sharing scheme for any given access structure
- Some hypersurfaces over finite fields, minimal codes and secret sharing schemes
- Secret sharing schemes from linear codes over F_p + v F_p
- Secret sharing schemes with nice access structures
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Access Structures of Elliptic Secret Sharing Schemes
- On a kind of two-weight code
- A secret sharing scheme from a chain ring linear code
- Computing and Combinatorics
- 2-secure codes from 2-SFP codes
- Antipodal two-weight rank metric codes
- The access structure of some secret-sharing schemes
- Minimal codewords: an application of relative four-weight codes
- Further results on support weights of certain subcodes
- Access structures of hyperelliptic secret sharing schemes
This page was built for publication: Secret Sharing Schemes from Two-Weight Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439104)
