2000 character limit reached
Optimal Codes from Fibonacci Polynomials and Secret Sharing Schemes (1611.08120v1)
Published 24 Nov 2016 in cs.IT and math.IT
Abstract: In this work, we study cyclic codes that have generators as Fibonacci polynomials over finite fields. We show that these cyclic codes in most cases produce families of maximum distance separable and optimal codes with interesting properties. We explore these relations and present some examples. Also, we present applications of these codes to secret sharing schemes.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.