The b-symbol weight hierarchy of the Kasami codes

被引:0
|
作者
Zhu, Hongwei [1 ,2 ]
Shi, Minjia [3 ,4 ]
机构
[1] Tsinghua Univ, Tsinghua Shenzhen Int Grad Sch, Shenzhen 518055, Peoples R China
[2] Anhui Univ, Sch Math Sci, Hefei 230601, Peoples R China
[3] Anhui Univ, Sch Math Sci, Key Lab Intelligent Comp & Signal Proc, Minist Educ, Hefei 230601, Peoples R China
[4] Chinese Acad Sci, State Key Lab Informat Secur, Inst Informat Engn, Beijing 100093, Peoples R China
关键词
Kasami codes; b -symbol metric; b -symbol weight hierarchy; Symbol-pair weight distribution; DISTANCE SEPARABLE CODES; CYCLIC CODES; HAMMING WEIGHTS; DISTRIBUTIONS;
D O I
10.1016/j.disc.2023.113774
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The symbol-pair read channel was first proposed by Cassuto and Blaum. Later, Yaakobi et al. generalized it to the b-symbol read channel. It is motivated by the limitations of the reading process in high density data storage systems. One main task in b-symbol coding theory is to determine the b-symbol weight hierarchy of codes. In this paper, we study the b-symbol weight hierarchy of the Kasami codes, which are well known for their applications to construct sequences with optimal correlation magnitudes. The complete symbol-pair weight distribution of the Kasami codes is determined. (c) 2023 Published by Elsevier B.V.
引用
收藏
页数:20
相关论文
共 50 条
  • [21] On the Weight Hierarchy of Product Codes
    Conchita Martínez-Pérez
    Wolfgang Willems
    [J]. Designs, Codes and Cryptography, 2004, 33 : 95 - 108
  • [22] Estimates on the Size of Symbol Weight Codes
    Chee, Yeow Meng
    Kiah, Han Mao
    Purkayastha, Punarbasu
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (01) : 301 - 314
  • [23] On Hamming and b-symbol distance distributions of repeated-root constacyclic codes of length 4ps over Fpm + uFpm
    Dinh, Hai Q.
    Singh, Abhay Kumar
    Thakur, Madhu Kant
    [J]. JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2021, 66 (1-2) : 885 - 905
  • [24] ON THE WEIGHT HIERARCHY OF GEOMETRIC GOPPA CODES
    YANG, K
    KUMAR, PV
    STICHTENOTH, H
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (03) : 913 - 920
  • [25] ON THE WEIGHT HIERARCHY OF IRREDUCIBLE CYCLIC CODES
    VANDERVLUGT, M
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 1995, 71 (01) : 159 - 167
  • [26] On the Weight Hierarchy of Locally Repairable Codes
    Hao, Jie
    Xia, Shu-Tao
    Chen, Bin
    Fu, Fang-Wei
    [J]. 2017 IEEE INFORMATION THEORY WORKSHOP (ITW), 2017, : 31 - 35
  • [27] Sphere Packing Bound and Gilbert-Varshamov Bound for b-Symbol Read Channels
    Song, Seunghoan
    Fujiwara, Toru
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2018, E101A (11) : 1915 - 1924
  • [28] The Weight Hierarchy of Some Reducible Cyclic Codes
    Xiong, Maosheng
    Li, Shuxing
    Ge, Gennian
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (07) : 4071 - 4080
  • [29] Bounds on the weight hierarchy of generalized concatenated codes
    Agabio, P
    Biglieri, E
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (05) : 1635 - 1640
  • [30] Extended Kasami Algorithm for cyclic codes
    Ho, HP
    Sweeney, P
    Paffett, J
    [J]. GLOBECOM 98: IEEE GLOBECOM 1998 - CONFERENCE RECORD, VOLS 1-6: THE BRIDGE TO GLOBAL INTEGRATION, 1998, : 2834 - 2839