Abstract:
Give out minimal linear code is defined, for a class of special subcode of minimal linear codes ［n,k;q］, a new class of minimal linear codes is constructed by deleting one coordinator of all code words. Furthermore, we define minimal linear code chain and prove that if C is an ［n,k;q］ minimal linear code and the minimal distance of C⊥ is larger than 2, then a minimal linear code chain can be constructed by this method. Based on the minimal linear code chain, a novel dynamic and verifiable secret sharing scheme is proposed. Compared with the former (t,n) threshold secret-sharing scheme, the proposed scheme not only has more interesting access structure, but also is of higher security and practicality.
