Linear ternary codes of strongly regular signed graphs

被引：0
|
作者：
Stanic, Zoran [1 ]
机构：
[1] Univ Belgrade, Fac Math, Studentski Trg 16, Belgrade 11000, Serbia
来源：
DISCRETE MATHEMATICS | 2024年 / 347卷 / 01期
关键词：
Finite field; Vector space; Adjacency matrix; Strong regularity; Code dimension; Code distance; BOUNDS;
D O I：
10.1016/j.disc.2023.113714
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We consider linear ternary codes generated by A + beta I, where A is the adjacency matrix of a strongly regular signed graph, I is the identity matrix and beta is an element of F3. Our results include theoretical examinations on dimension and distance, and the interplay between the codes. We also compute many structural parameters of codes for some infinite families of strongly regular signed graphs and establish more than 60 particular codes of comparatively small dimension. It occurs that some known linear ternary codes are covered by this approach.(c) 2023 Elsevier B.V. All rights reserved.
引用
收藏
页数：17
相关论文
共 50 条
  • [31] Ring geometries, two-weight codes, and strongly regular graphs
    Eimear Byrne
    Marcus Greferath
    Thomas Honold
    [J]. Designs, Codes and Cryptography, 2008, 48
  • [32] SOME NEW 2-WEIGHT CODES AND STRONGLY REGULAR GRAPHS
    BROUWER, AE
    [J]. DISCRETE APPLIED MATHEMATICS, 1985, 10 (01) : 111 - 114
  • [33] Quasi-balanced weighing matrices, signed strongly regular graphs and association schemes
    Kharaghani, Hadi
    Pender, Thomas
    Suda, Sho
    [J]. FINITE FIELDS AND THEIR APPLICATIONS, 2022, 83
  • [34] STRONGLY REGULAR GRAPHS
    HUBAUT, XL
    [J]. DISCRETE MATHEMATICS, 1975, 13 (04) : 357 - 381
  • [35] Strongly regular vertices and partially strongly regular graphs
    Fiala, NC
    [J]. ARS COMBINATORIA, 2004, 72 : 97 - 110
  • [36] ON REGULAR SIGNED GRAPHS WITH THREE EIGENVALUES
    Andelic, Milica
    Koledin, Tamara
    Stanic, Zoran
    [J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2020, 40 (02) : 405 - 416
  • [37] On co-regular signed graphs
    Hameed, Shahul K.
    Paul, Viji
    Germina, K. A.
    [J]. AUSTRALASIAN JOURNAL OF COMBINATORICS, 2015, 62 : 8 - 17
  • [38] REGULAR CODES IN REGULAR GRAPHS ARE DIFFICULT
    KRATOCHVIL, J
    [J]. DISCRETE MATHEMATICS, 1994, 133 (1-3) : 191 - 205
  • [39] 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)
  • [40] Three-Weight Codes over Rings and Strongly Walk Regular Graphs
    Minjia Shi
    Michael Kiermaier
    Sascha Kurz
    Patrick Solé
    [J]. Graphs and Combinatorics, 2022, 38
12345