Yayın:
Optimal binary codes derived from F2F4-additive cyclic codes

Basit öğe sayfası
dc.contributor.authorAbualrub, Taher
dc.contributor.authorAydin, Nuh
dc.contributor.authorAydogdu, Ismail
dc.date.accessioned2026-06-27T14:29:57Z
dc.date.issued2020
dc.description.abstractIn this paper, we study the algebraic structure of additive cyclic codes over the alphabet Fr 2 x Fs 4 = Fr 2Fs 4, where r and s are non-negative integers, F2 = GF(2) and F4 = GF(4) are the finite fields of 2 and 4 elements, respectively. We determine generator polynomials for F2F4-additive cyclic codes. We also introduce a linear map W that depends on the trace map T to relate these codes to binary linear codes over F2. Further, we investigate the duals of F2F4-additive cyclic codes. We show that the dual of any F2F4-additive cyclic code is another F2F4-additive cyclic code. Using the mapping W, we provide examples of F2F4-additive cyclic codes whose binary images have optimal parameters. We also consider additive cyclic codes over F4 and give some examples of optimal parameter quantum codes over F4.en
dc.description.urihttps://doi.org/10.1007/s12190-020-01344-5
dc.identifier.doi10.1007/s12190-020-01344-5
dc.identifier.eissn1865-2085
dc.identifier.endpage87
dc.identifier.issn1598-5865
dc.identifier.issue1-2
dc.identifier.startpage71
dc.identifier.urihttps://hdl.handle.net/20.500.14981/61325
dc.identifier.volume64
dc.identifier.wos000524249200001
dc.language.isoeng
dc.publisherSPRINGER HEIDELBERG
dc.relation.ispartofJOURNAL OF APPLIED MATHEMATICS AND COMPUTING
dc.subjectF2F4-additive cyclic codes
dc.subjectDuality
dc.subjectQuantum codes
dc.subjectOptimal codes
dc.subjectMathematics
dc.titleOptimal binary codes derived from F2F4-additive cyclic codes
dc.typeArticle
dspace.entity.typePublication
local.import.sourceWOS

Dosyalar

Koleksiyonlar

Yayınlar