Strongly regular graphs from reducible cyclic codes

被引:5
|
作者
Shi, Minjia [1 ]
Helleseth, Tor [2 ]
Sole, Patrick [3 ]
机构
[1] Anhui Univ, Sch Math Sci, Key Lab Intelligent Comp & Signal Proc, Minist Educ, Hefei 230601, Peoples R China
[2] Univ Bergen, Dept Informat, Selmer Ctr, Bergen, Norway
[3] Univ Aix Marseille, CNRS, Cent Marseille, I2M, Marseille, France
基金
中国国家自然科学基金;
关键词
2-weight codes; Reducible cyclic codes; Strongly regular graphs;
D O I
10.1007/s10801-020-01006-6
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let p be a prime number. Reducible cyclic codes of rank 2 over Z(pm) are shown to have exactly two Hamming weights in some cases. Their weight distribution is computed explicitly. When these codes are projective, the coset graphs of their dual codes are strongly regular. The spectra of these graphs are determined.
引用
收藏
页码:173 / 184
页数:12
相关论文
共 50 条
  • [31] STRONGLY REGULAR GRAPHS
    HUBAUT, XL
    [J]. DISCRETE MATHEMATICS, 1975, 13 (04) : 357 - 381
  • [32] Strongly regular vertices and partially strongly regular graphs
    Fiala, NC
    [J]. ARS COMBINATORIA, 2004, 72 : 97 - 110
  • [33] Strongly Regular Graphs from Weakly Regular Plateaued Functions
    Mesnager, Sihem
    Sinak, Ahmet
    [J]. 2019 NINTH INTERNATIONAL WORKSHOP ON SIGNAL DESIGN AND ITS APPLICATIONS IN COMMUNICATIONS (IWSDA), 2019,
  • [34] Cyclic codes and reducible additive equations
    Guneri, Cem
    Ozbudak, Ferruh
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (02) : 848 - 853
  • [35] Strongly regular graphs from differences of quadrics
    Hamilton, N
    [J]. DISCRETE MATHEMATICS, 2002, 256 (1-2) : 465 - 469
  • [36] Weight enumerators of reducible cyclic codes and their dual codes
    Wu, Yansheng
    Yue, Qin
    Zhu, Xiaomeng
    Yang, Shudi
    [J]. DISCRETE MATHEMATICS, 2019, 342 (03) : 671 - 682
  • [37] Three-Weight Codes over Rings and Strongly Walk Regular Graphs
    Minjia Shi
    Michael Kiermaier
    Sascha Kurz
    Patrick Solé
    [J]. Graphs and Combinatorics, 2022, 38
  • [38] Three-Weight Codes over Rings and Strongly Walk Regular Graphs
    Shi, Minjia
    Kiermaier, Michael
    Kurz, Sascha
    Sole, Patrick
    [J]. GRAPHS AND COMBINATORICS, 2022, 38 (03)
  • [39] REGULAR CODES IN REGULAR GRAPHS ARE DIFFICULT
    KRATOCHVIL, J
    [J]. DISCRETE MATHEMATICS, 1994, 133 (1-3) : 191 - 205
  • [40] Star complementary strongly regular decompositions of strongly regular graphs
    Stanic, Z.
    [J]. LINEAR & MULTILINEAR ALGEBRA, 2020, 68 (12): : 2448 - 2461