The Plotkin-Type Bound on the Generalized Symbol-Pair Weight and Symbol-Pair Equiweight Codes

被引：0
|
作者：
Liang, Yinghao [1 ]
Liu, Zihui [1 ,2 ]
机构：
[1] Beijing Inst Technol, Dept Math, Beijing 100081, Peoples R China
[2] Beijing Inst Technol, Key Lab Math Theory & Computat Informat Secur, Beijing 100081, Peoples R China
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2024年 / 70卷 / 07期
基金：
北京市自然科学基金;
关键词：
Codes; Vectors; Measurement; Graph theory; Generators; Linear programming; Linear codes; Symbol-pair weight; generalized value assignment; Plotkin-type bound; block intersection graph; Hamilton cycle; HAMMING WEIGHTS;
D O I：
10.1109/TIT.2024.3392744
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We present the Plotkin-type bound on the generalized symbol-pair weight and show that all the symbol-pair equiweight codes achieve the Plotkin-type bound. Some new judging criteria are given for symbol-pair equiweight codes, and based on these judging criteria, we show the existence of a class of symbol-pair equiweight codes by design and graph theory. Also, we explicitly construct the symbol-pair version simplex code by the action of a group on a set. Furthermore, we construct several classes of inequiweight codes achieving the Plotkin-type bound.
引用
收藏
页码：4990 / 5001
页数：12
相关论文
共 50 条
  • [41] Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes
    Shuxing Li
    Gennian Ge
    Designs, Codes and Cryptography, 2017, 84 : 359 - 372
  • [42] Linear Programming Decoding of Binary Linear Codes for Symbol-Pair Read Channel
    Horii, Shunsuke
    Matsushima, Toshiyasu
    Hirasawa, Shigeichi
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2016, E99A (12): : 2170 - 2178
  • [43] MDS and AMDS symbol-pair codes constructed from repeated-root cyclic codes
    Tang, Xiuxin
    Luo, Rong
    FINITE FIELDS AND THEIR APPLICATIONS, 2023, 89
  • [44] New Families of MDS Symbol-Pair Codes From Matrix-Product Codes
    Luo, Gaojun
    Ezerman, Martianus Frederic
    Ling, San
    Pan, Xu
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2023, 69 (03) : 1567 - 1587
  • [45] A NEW CLASS OF AMDS SYMBOL-PAIR CODES FROM REPEATED-ROOT CODES
    Yang, Jin
    Kai, Xiaoshan
    Tang, Yongsheng
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2024,
  • [46] Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes
    Li, Shuxing
    Ge, Gennian
    DESIGNS CODES AND CRYPTOGRAPHY, 2017, 84 (03) : 359 - 372
  • [47] Linear Programming Decoding of Binary Linear Codes for Symbol-Pair Read Channels
    Horii, Shunsuke
    Matsushima, Toshiyasu
    Hirasawa, Shigeichi
    2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 1944 - 1948
  • [48] Error-Trapping Decoding for Cyclic Codes over Symbol-Pair Read Channels
    Takita, Makoto
    Hirotomo, Masanori
    Morii, Masakatu
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2017, E100A (12): : 2578 - 2584
  • [49] On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths
    Dinh, Hai Q.
    Bac Trong Nguyen
    Singh, Abhay Kumar
    Sriboonchitta, Songsak
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (04) : 2417 - 2430
  • [50] Error-Trapping Decoding for Cyclic Codes over Symbol-Pair Read Channels
    Takita, Makoto
    Hirotomo, Masanori
    Morii, Masakatu
    PROCEEDINGS OF 2016 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2016), 2016, : 681 - 685
12345