LCP of group codes over finite Frobenius rings

被引：4
|
作者：
Liu, Xiusheng [1 ]
Liu, Hualu [2 ]
机构：
[1] Hubei Normal Univ, Coll Arts & Sci, Sch Sci & Technol, Huangshi 435109, Hubei, Peoples R China
[2] Hubei Univ Technol, Sch Sci, Wuhan 430068, Hubei, Peoples R China
来源：
DESIGNS CODES AND CRYPTOGRAPHY | 2023年 / 91卷 / 03期
关键词：
Finite Frobenius rings; LCP of group codes; Code equivalence; LINEAR COMPLEMENTARY PAIRS;
D O I：
10.1007/s10623-022-01120-5
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A pair (C, D) of group codes in R[G] is called a linear complementary pair (abbreviated to LCP) if C circle plus D = R[G], where R is a finite Frobenius ring, and G is a finite group. We provide a necessary and sufficient condition for a pair (C, D) of group codes in R[G] to be LCP. Furthermore, we prove that if (C, D) is an LCP of group codes in R[G], then C and D-perpendicular to are permutation equivalent.
引用
收藏
页码：695 / 708
页数：14
相关论文
共 50 条
  • [1] LCP of group codes over finite Frobenius rings
    Xiusheng Liu
    Hualu Liu
    [J]. Designs, Codes and Cryptography, 2023, 91 : 695 - 708
  • [2] LCP of constacyclic codes over finite chain rings
    Ridhima Thakral
    Sucheta Dutt
    Ranjeet Sehmi
    [J]. Journal of Applied Mathematics and Computing, 2023, 69 : 1989 - 2001
  • [3] LCP of constacyclic codes over finite chain rings
    Thakral, Ridhima
    Dutt, Sucheta
    Sehmi, Ranjeet
    [J]. JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2023, 69 (02) : 1989 - 2001
  • [4] New bounds for codes over finite Frobenius rings
    Eimear Byrne
    Marcus Greferath
    Axel Kohnert
    Vitaly Skachek
    [J]. Designs, Codes and Cryptography, 2010, 57 : 169 - 179
  • [5] New bounds for codes over finite Frobenius rings
    Byrne, Eimear
    Greferath, Marcus
    Kohnert, Axel
    Skachek, Vitaly
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2010, 57 (02) : 169 - 179
  • [6] The linear programming bound for codes over finite Frobenius rings
    Eimear Byrne
    Marcus Greferath
    Michael E. O’Sullivan
    [J]. Designs, Codes and Cryptography, 2007, 42
  • [7] The linear programming bound for codes over finite Frobenius rings
    Byrne, Eimear
    Greferath, Marcus
    O'Sullivan, Michael E.
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2007, 42 (03) : 289 - 301
  • [8] Matrix product codes over finite commutative Frobenius rings
    Yun Fan
    San Ling
    Hongwei Liu
    [J]. Designs, Codes and Cryptography, 2014, 71 : 201 - 227
  • [9] Matrix product codes over finite commutative Frobenius rings
    Fan, Yun
    Ling, San
    Liu, Hongwei
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2014, 71 (02) : 201 - 227
  • [10] MacWilliams identities for linear codes over finite Frobenius rings
    Honold, T
    Landjev, I
    [J]. FINITE FIELDS AND APPLICATIONS, 2001, : 276 - 292
12345