Two-Weight Linear Codes and Their Applications in Secret Sharing

Linear codes with few weighs have many applications in secret sharing. Determining the access structure of the secret sharing scheme based on a linear code is a very difficult problem. We provides a method to construct a class of two-weight torsion codes over finite non-chain ring. We determine the minimal codewords of these torsion codes over the finite non-chain ring. Based on the two-weight codes, we find the access structures of secret sharing schemes.