Yayın:
Optimal codes from Fibonacci polynomials and secret sharing schemes

Basit öğe sayfası
dc.contributor.authorKoroglu, Mehmet E.
dc.contributor.authorOzbek, Ibrahim
dc.contributor.authorSiap, Irfan
dc.date.accessioned2026-06-27T14:05:57Z
dc.date.issued2017
dc.description.abstractIn 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.en
dc.description.sponsorshipTUBITAK-ARDEB [114F388]
dc.description.urihttps://doi.org/10.1007/s40065-017-0171-7
dc.identifier.doi10.1007/s40065-017-0171-7
dc.identifier.eissn2193-5351
dc.identifier.endpage308
dc.identifier.issn2193-5343
dc.identifier.issue4
dc.identifier.startpage297
dc.identifier.urihttps://hdl.handle.net/20.500.14981/56973
dc.identifier.volume6
dc.identifier.wos000414789500004
dc.language.isoeng
dc.publisherSPRINGER HEIDELBERG
dc.relation.ispartofARABIAN JOURNAL OF MATHEMATICS
dc.rightsopenAccess
dc.subjectMathematics
dc.titleOptimal codes from Fibonacci polynomials and secret sharing schemes
dc.typeArticle
dspace.entity.typePublication
local.import.sourceWOS

Dosyalar

Koleksiyonlar

Yayınlar