Secret sharing schemes from binary linear codes (Q621578): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 08:15, 30 January 2024

scientific article
Language Label Description Also known as
English
Secret sharing schemes from binary linear codes
scientific article

    Statements

    Secret sharing schemes from binary linear codes (English)
    0 references
    0 references
    0 references
    0 references
    28 January 2011
    0 references
    This paper deals with the applications of linear codes to secret sharing schemes. The questions related to determining the access structure for such schemes, in general, is a difficult problem. The paper goes on to describe minimal access sets for certain classes of linear codes and then proves that the secret sharing schemes so obtained are democratic in the sense that every participant is involved in the same number of minimal access sets. The paper under review seems to have connections with the concept of defining sets in block designs and this is perhaps worth exploring.
    0 references
    secret sharing schemes
    0 references
    access structures
    0 references
    irreducible cyclic codes
    0 references
    BCH codes
    0 references
    Melas codes
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references