Noncommutative rings and their applications, IV, Arras, France, 8 - 11 June 2015, pp.30
Secret sharing schemes have found applications in specic cryptography . These schemes oer a way to protect the secret key by distributing shares
to participants. Many methods have been developed over the last decades [4, 6]. One of these methods is based on exploring the minimal codewords
in a linear code . But determining the minimal codewords of a code is very challenging and dicult problem in general [1, 3]. In this study, we
characterize minimal codewords of a special class of cyclic codes that have generators as Fibonacci polynomials over nite elds. Also, we determine
access structures of these codes which are crucial to secret sharing.