Ideal access structures based on a class of minimal linear codes
From MaRDI portal
Recommendations
Cites work
- A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme
- A note on ramp secret sharing schemes from error-correcting codes
- An ideal multi-secret sharing scheme based on MSP
- Characterizing Ideal Weighted Threshold Secret Sharing
- Cheating-immune secret sharing schemes from codes and cumulative arrays
- Complex Codebooks From Combinatorial Designs
- Explicit lifts of quintic Jacobi sums and period polynomials for \(\mathbb F_q\)
- Hamming weights in irreducible cyclic codes
- How to share a secret
- scientific article; zbMATH DE number 2040937 (Why is no real title available?)
- Minimal codewords in Reed-Muller codes
- Minimal vectors in linear codes
- New classes of 2-weight cyclic codes
- Perfect secret sharing scheme based on vertex domination set
- Secret sharing schemes from binary linear codes
- The weight distribution of some irreducible cyclic codes
- The Weight Distribution of Some Irreducible Cyclic Codes
- Weight distribution of some reducible cyclic codes
This page was built for publication: Ideal access structures based on a class of minimal linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958257)