Pages that link to "Item:Q621578"

The following pages link to Secret sharing schemes from binary linear codes (Q621578):

Displaying 20 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)
• A flaw in the use of minimal defining sets for secret sharing schemes (Q851751) (← links)
• Secret-sharing with a class of ternary codes (Q1583097) (← links)
• Optimal codes from Fibonacci polynomials and secret sharing schemes (Q1690548) (← links)
• Secret sharing schemes based on graphical codes (Q2016393) (← links)
• Secret sharing schemes based on the dual of Golay codes (Q2121024) (← links)
• On relative constant-weight codes (Q2339140) (← links)
• Secret sharing schemes based on additive codes over \(\mathrm{GF}(4)\) (Q2397159) (← links)
• The optimal linear secret sharing scheme for any given access structure (Q2440328) (← links)
• Some hypersurfaces over finite fields, minimal codes and secret sharing schemes (Q2672305) (← links)
• Secret sharing schemes from linear codes over \(\mathbb F_p + v \mathbb F_p\) (Q2833544) (← links)
• Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions (Q2948388) (← 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)
• Minimal codewords: an application of relative four-weight codes (Q6637066) (← links)