Vis enkel innførsel

dc.contributor.authorShi, Minjia
dc.contributor.authorHelleseth, Tor
dc.contributor.authorÖzbudak, Ferruh
dc.date.accessioned2024-04-17T08:28:32Z
dc.date.available2024-04-17T08:28:32Z
dc.date.created2024-01-12T14:29:12Z
dc.date.issued2023
dc.identifier.issn0018-9448
dc.identifier.urihttps://hdl.handle.net/11250/3126930
dc.description.abstractLet Fq0 be a finite field of odd characteristic. For an integer s≥1 , let Cs(q0) be the generalized Zetterberg code of length qs0+1 over Fq0 . If s is even, then we prove that the covering radius of Cs(q0) is 3. Put q=qs0 . If s is odd and q≢7mod8 , then we present an explicit lower bound N1(q0) so that if s≥N1(q0) , then the covering radius of Cs(q0) is 3. We also show that the covering radius of C1(q0) is 2. Moreover we study some cases when s is an odd integer with 3≤s≤N1(q0) and, rather unexpectedly, we present concrete examples with covering radius 2 in that range. We introduce half generalized Zetterberg codes of length (qs0+1)/2 if q≡1mod4 . Similarly we introduce twisted half generalized Zetterberg codes of length (qs0+1)/2 if q≡3mod4 . We show that the same results hold for the half and twisted half generalized Zetterberg codes.en_US
dc.language.isoengen_US
dc.publisherIEEEen_US
dc.titleCovering Radius of Generalized Zetterberg Type Codes Over Finite Fields of Odd Characteristicen_US
dc.typeJournal articleen_US
dc.typePeer revieweden_US
dc.description.versionacceptedVersionen_US
dc.rights.holderCopyright 2023 IEEEen_US
cristin.ispublishedtrue
cristin.fulltextpostprint
cristin.qualitycode2
dc.identifier.doi10.1109/TIT.2023.3296754
dc.identifier.cristin2225525
dc.source.journalIEEE Transactions on Information Theoryen_US
dc.source.pagenumber7025 - 7048en_US
dc.identifier.citationIEEE Transactions on Information Theory. 2023, 69 (11), 7025 - 7048.en_US
dc.source.volume69en_US
dc.source.issue11en_US


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel