dc.contributor.author | Shi, Minjia | |
dc.contributor.author | Zhu, Hongwei | |
dc.contributor.author | Helleseth, Tor | |
dc.date.accessioned | 2024-04-17T08:50:11Z | |
dc.date.available | 2024-04-17T08:50:11Z | |
dc.date.created | 2024-01-12T15:23:23Z | |
dc.date.issued | 2023 | |
dc.identifier.issn | 0018-9448 | |
dc.identifier.uri | https://hdl.handle.net/11250/3126942 | |
dc.description.abstract | The r -th generalized Hamming metric and the b -symbol metric are two different generalizations of Hamming metric. The former is used on the wire-tap channel of Type II, and the latter is motivated by the limitations of the reading process in high-density data storage systems and applied to a read channel that outputs overlapping symbols. In this paper, we study the connections among the three metrics (that is, Hamming metric, b -symbol metric, and r -th generalized Hamming metric) mentioned above and give a conjecture about the b -symbol Griesmer Bound for cyclic codes. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | IEEE | en_US |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internasjonal | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/deed.no | * |
dc.title | The Connections Among Hamming Metric, b-Symbol Metric, and r-th Generalized Hamming Metric | en_US |
dc.type | Journal article | en_US |
dc.type | Peer reviewed | en_US |
dc.description.version | publishedVersion | en_US |
cristin.ispublished | true | |
cristin.fulltext | postprint | |
cristin.qualitycode | 2 | |
dc.identifier.doi | 10.1109/TIT.2023.3239543 | |
dc.identifier.cristin | 2225604 | |
dc.source.journal | IEEE Transactions on Information Theory | en_US |
dc.source.pagenumber | 2485 - 2493 | en_US |
dc.identifier.citation | IEEE Transactions on Information Theory. 2023, 69 (4), 2485 - 2493. | en_US |
dc.source.volume | 69 | en_US |
dc.source.issue | 4 | en_US |