dc.contributor.author | Shi, Minjia | |
dc.contributor.author | Helleseth, Tor | |
dc.contributor.author | Özbudak, Ferruh | |
dc.date.accessioned | 2024-04-17T08:28:32Z | |
dc.date.available | 2024-04-17T08:28:32Z | |
dc.date.created | 2024-01-12T14:29:12Z | |
dc.date.issued | 2023 | |
dc.identifier.issn | 0018-9448 | |
dc.identifier.uri | https://hdl.handle.net/11250/3126930 | |
dc.description.abstract | Let 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.iso | eng | en_US |
dc.publisher | IEEE | en_US |
dc.title | Covering Radius of Generalized Zetterberg Type Codes Over Finite Fields of Odd Characteristic | en_US |
dc.type | Journal article | en_US |
dc.type | Peer reviewed | en_US |
dc.description.version | acceptedVersion | en_US |
dc.rights.holder | Copyright 2023 IEEE | en_US |
cristin.ispublished | true | |
cristin.fulltext | postprint | |
cristin.qualitycode | 2 | |
dc.identifier.doi | 10.1109/TIT.2023.3296754 | |
dc.identifier.cristin | 2225525 | |
dc.source.journal | IEEE Transactions on Information Theory | en_US |
dc.source.pagenumber | 7025 - 7048 | en_US |
dc.identifier.citation | IEEE Transactions on Information Theory. 2023, 69 (11), 7025 - 7048. | en_US |
dc.source.volume | 69 | en_US |
dc.source.issue | 11 | en_US |