{"title":"The b-Symbol Hamming Weight Spectra of Quaternary Kerdock Codes and Related Codes","authors":"Hongwei Zhu;Xiaoxiao Li;Minjia Shi;Shu-Tao Xia;Tor Helleseth","doi":"10.1109/TIT.2025.3590510","DOIUrl":null,"url":null,"abstract":"The symbol-pair coding theory was put forward by Cassuto and Blaum [IEEE TIT, 2011] to be applicable in high-density storage situations. Yaakobi et al. [IEEE TIT, 2016] extended the concept of symbol-pair metric to <italic>b</i>-symbol metric when <inline-formula> <tex-math>$b\\geq 2$ </tex-math></inline-formula>. The extensive research on the <italic>b</i>-symbol Hamming weight spectra of cyclic codes has been centered on the case where the alphabet is a finite field. The case of cyclic codes over <inline-formula> <tex-math>${\\mathbb {Z}}_{4}$ </tex-math></inline-formula>, an extremely important class of codes, has been overlooked for a long time in the exploration of the <italic>b</i>-symbol Hamming weight spectra. In this paper, we study the <italic>b</i>-symbol Hamming weight spectra of the shortened Kerdock codes <inline-formula> <tex-math>${\\mathcal {K}}_{m}^{-}$ </tex-math></inline-formula> and the Kerdock codes <inline-formula> <tex-math>${\\mathcal {K}}_{m}$ </tex-math></inline-formula> over <inline-formula> <tex-math>${\\mathbb {Z}}_{4}$ </tex-math></inline-formula>. The formulas for calculating the symbol-pair Hamming weight of the codewords in <inline-formula> <tex-math>${\\mathcal {K}}_{m}^{-}$ </tex-math></inline-formula> and <inline-formula> <tex-math>${\\mathcal {K}}_{m}$ </tex-math></inline-formula> are given, and their values hinge on the trace-like function values of specific elements in the Teichmüller set. In particular, we present a class of <inline-formula> <tex-math>${\\mathbb {Z}}_{4}$ </tex-math></inline-formula>-cyclic codes with three non-zero <italic>b</i>-symbol Hamming weights. As by-products, the <italic>b</i>-symbol Hamming weight hierarchies of the Preparata codes and the Goethals codes are provided.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 9","pages":"6727-6742"},"PeriodicalIF":2.9000,"publicationDate":"2025-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Theory","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11090027/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
The symbol-pair coding theory was put forward by Cassuto and Blaum [IEEE TIT, 2011] to be applicable in high-density storage situations. Yaakobi et al. [IEEE TIT, 2016] extended the concept of symbol-pair metric to b-symbol metric when $b\geq 2$ . The extensive research on the b-symbol Hamming weight spectra of cyclic codes has been centered on the case where the alphabet is a finite field. The case of cyclic codes over ${\mathbb {Z}}_{4}$ , an extremely important class of codes, has been overlooked for a long time in the exploration of the b-symbol Hamming weight spectra. In this paper, we study the b-symbol Hamming weight spectra of the shortened Kerdock codes ${\mathcal {K}}_{m}^{-}$ and the Kerdock codes ${\mathcal {K}}_{m}$ over ${\mathbb {Z}}_{4}$ . The formulas for calculating the symbol-pair Hamming weight of the codewords in ${\mathcal {K}}_{m}^{-}$ and ${\mathcal {K}}_{m}$ are given, and their values hinge on the trace-like function values of specific elements in the Teichmüller set. In particular, we present a class of ${\mathbb {Z}}_{4}$ -cyclic codes with three non-zero b-symbol Hamming weights. As by-products, the b-symbol Hamming weight hierarchies of the Preparata codes and the Goethals codes are provided.
期刊介绍:
The IEEE Transactions on Information Theory is a journal that publishes theoretical and experimental papers concerned with the transmission, processing, and utilization of information. The boundaries of acceptable subject matter are intentionally not sharply delimited. Rather, it is hoped that as the focus of research activity changes, a flexible policy will permit this Transactions to follow suit. Current appropriate topics are best reflected by recent Tables of Contents; they are summarized in the titles of editorial areas that appear on the inside front cover.