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 条
  • [41] Designs, strongly regular graphs and codes constructed from some primitive groups
    Crnkovic, Dean
    Crnkovic, Vedrana Mikulic
    Rodrigues, B. G.
    [J]. INFORMATION SECURITY, CODING THEORY AND RELATED COMBINATORICS: INFORMATION CODING AND COMBINATORICS, 2011, 29 : 231 - 252
  • [42] Star complementary strongly regular decompositions of strongly regular graphs
    Stanic, Z.
    [J]. LINEAR & MULTILINEAR ALGEBRA, 2020, 68 (12): : 2448 - 2461
  • [43] EMBEDDING ARBITRARY GRAPHS INTO STRONGLY REGULAR AND DISTANCE REGULAR GRAPHS
    Fon-Der-Flaass, D. G.
    [J]. SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2005, 2 : 218 - 221
  • [44] Observability in Connected Strongly Regular Graphs and Distance Regular Graphs
    Kibangou, Alain Y.
    Commault, Christian
    [J]. IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, 2014, 1 (04): : 360 - 369
  • [45] Extension of strongly regular graphs
    Gera, Ralucca
    Shen, Jian
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2008, 15 (01):
  • [46] Random strongly regular graphs?
    Cameron, PJ
    [J]. DISCRETE MATHEMATICS, 2003, 273 (1-3) : 103 - 114
  • [47] On Generalized Strongly Regular Graphs
    Jia, Dongdong
    Yuan, Landang
    Zhang, Gengsheng
    [J]. GRAPHS AND COMBINATORICS, 2018, 34 (04) : 555 - 570
  • [48] On the Integrability of Strongly Regular Graphs
    Jack H. Koolen
    Masood Ur Rehman
    Qianqian Yang
    [J]. Graphs and Combinatorics, 2019, 35 : 1273 - 1291
  • [49] Approximately strongly regular graphs
    Ihringer, Ferdinand
    [J]. DISCRETE MATHEMATICS, 2023, 346 (03)
  • [50] On strongly regular graphs with μ ≤ 2
    Bagchi, Bhaskar
    [J]. DISCRETE MATHEMATICS, 2006, 306 (14) : 1502 - 1504
12345