Yayın:
On the number of Z2Z4 and ZpZp2-additive cyclic codes

Basit öğe sayfası
dc.contributor.authorYildiz, Eda
dc.contributor.authorAbualrub, Taher
dc.contributor.authorAydogdu, Ismail
dc.date.accessioned2026-06-27T14:32:49Z
dc.date.issued2023
dc.description.abstractIn this paper, we give the exact number of Z(2)Z(4)-additive cyclic codes of length n = r + s, for any positive integer r and any positive odd integer s. We will provide a formula for the the number of separable Z(2)Z(4)-additive cyclic codes of length n and then a formula for the number of non-separable Z(2)Z(4)-additive cyclic codes of length n. Then, we have generalized our approach to give the exact number of Z(p)Z(p2)-additive cyclic codes of length n = r + s, for any prime p, any positive integer r and any positive integer s where gcd (p, s) = 1. Moreover, we will provide examples of the number of these codes with different lengths n = r + s.en
dc.description.urihttps://doi.org/10.1007/s00200-020-00474-4
dc.identifier.doi10.1007/s00200-020-00474-4
dc.identifier.eissn1432-0622
dc.identifier.endpage97
dc.identifier.issn0938-1279
dc.identifier.issue1
dc.identifier.startpage81
dc.identifier.urihttps://hdl.handle.net/20.500.14981/61904
dc.identifier.volume34
dc.identifier.wos000607099100001
dc.language.isoeng
dc.publisherSPRINGER
dc.relation.ispartofAPPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING
dc.subjectZ(2)Z(4)-additive cyclic codes
dc.subjectZ(p)Z(p2)-additive cyclic codes
dc.subjectcounting
dc.subjectseparable
dc.subjectnon-separable codes
dc.subjectComputer Science
dc.subjectMathematics
dc.titleOn the number of Z2Z4 and ZpZp2-additive cyclic codes
dc.typeArticle
dspace.entity.typePublication
local.import.sourceWOS

Dosyalar

Koleksiyonlar

Yayınlar