The construction of a secret sharing scheme via colon ideal

The secret sharing scheme, which plays an important role in ensuring data security, is the administration of a secret among users. Only certain users can reconstruct the secret by bringing their parts together. A secret sharing system can be built with the help of different disciplines, coding theory is one of these disciplines. In this study, a secret sharing scheme will be built using error correcting codes. In this system, colon ideal method will be used to correct errors. In this thesis, firstly the linear codes will be explained. Then, in the third part, some secret sharing schemes built using linear codes will be given. In the fourth section, some definitions will be given for the algebraic geometry and a secret sharing scheme that uses this method will be constructed after the error correction method is explained with the help of the colon ideal.