Pages that link to "Item:Q621578"
From MaRDI portal
The following pages link to Secret sharing schemes from binary linear codes (Q621578):
Displaying 12 items.
- On the intersection of binary linear codes (Q328230) (← links)
- The maximum number of minimal codewords in an \([n,k]\)-code (Q389190) (← links)
- New code equivalence based on relative generalized Hamming weights (Q433083) (← links)
- Further results on support weights of certain subcodes (Q717144) (← links)
- Attribute-based signcryption scheme based on linear codes (Q778458) (← links)
- Optimal codes from Fibonacci polynomials and secret sharing schemes (Q1690548) (← links)
- On relative constant-weight codes (Q2339140) (← links)
- Secret sharing schemes based on additive codes over \(\mathrm{GF}(4)\) (Q2397159) (← links)
- Some hypersurfaces over finite fields, minimal codes and secret sharing schemes (Q2672305) (← links)
- Ideal access structures based on a class of minimal linear codes (Q2958257) (← links)
- (Q4577752) (← links)
- A novel secret sharing scheme based on minimal linear codes (Q4981087) (← links)
