Yayın:
Z2Z4-Additive Cyclic Codes

dc.contributor.authorAbualrub, Taher
dc.contributor.authorSiap, Irfan
dc.contributor.authorAydin, Nuh
dc.date.accessioned2026-06-27T13:31:07Z
dc.date.issued2014
dc.description.abstractIn this paper, we study Z(2)Z(4)-additive cyclic codes. These codes are identified as Z(4)[x]-submodules of the ring R-r,R-s = Z(2)[x]/ x Z(4) [x]/ . The algebraic structure of this family of codes is studied and a set of generator polynomials for this family as a Z(4)[x]-submodule of the ring R-r,R-s is determined. We show that the duals of Z(2)Z(4)-additive cyclic codes are also cyclic. We also present an infinite family of Maximum Distance separable with respect to the singleton bound codes. Finally, we obtain a number of binary linear codes with optimal parameters from the Z(2)Z(4)-additive cyclic codes.en
dc.description.urihttps://doi.org/10.1109/tit.2014.2299791
dc.identifier.doi10.1109/tit.2014.2299791
dc.identifier.eissn1557-9654
dc.identifier.endpage1514
dc.identifier.issn0018-9448
dc.identifier.issue3
dc.identifier.startpage1508
dc.identifier.urihttps://hdl.handle.net/20.500.14981/53470
dc.identifier.volume60
dc.identifier.wos000331902400010
dc.language.isoeng
dc.publisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
dc.relation.ispartofIEEE TRANSACTIONS ON INFORMATION THEORY
dc.subjectAdditive codes
dc.subjectadditive cyclic codes
dc.subjectoptimal codes
dc.subjectbounds
dc.subjectComputer Science
dc.subjectEngineering
dc.subjectMathematics
dc.titleZ2Z4-Additive Cyclic Codes
dc.typeArticle
dspace.entity.typePublication
local.import.sourceWOS

Dosyalar

Koleksiyonlar