The Adjacency Codes of the First Yellow Graphs  

作　　者：SHI Minjia LI Shitao KIM Jon-Lark SOLE Patrick 

机构地区：[1]Key Laboratory of Intelligent Computing and Signal Processing,Ministry of Education,School of Mathematical Sciences,Anhui University,Hefei 230601,China [2]State Key Laboratory of Information Security,Institute of Information Engineering,Chinese Academy of Sciences,Beijing 100093,China [3]School of Mathematical Sciences,Anhui University,Hefei 230026,China [4]Department of Math,Sogang University,Seoul,South Korea [5]Aix Marseille Univ,CNRS,Centrale Marseille,I2M,Marseille,France

出　　处：《Journal of Systems Science & Complexity》2023年第4期1757-1768,共12页系统科学与复杂性学报（英文版）

基　　金：supported by the National Natural Science Foundation of China under Grant Nos. 12071001;2021 University Graduate Research Project under Grant Nos. Y020410077;the National Natural Science Foundation of China under Grant No. 12201170;the Natural Science Foundation of Anhui Province under Grant No. 2108085QA03

摘　　要：The authors study the binary codes spanned by the adjacency matrices of the strongly regular graphs(SRGs)on at most two hundred vertices whose existence is unknown.The authors show that in length less than one hundred they cannot be cyclic,except for the exceptions of the SRGs of parameters(85,42,20,21)and(96,60,38,36).In particular,the adjacency code of a(85,42,20,21)is the zero-sum code.In the range[100,200]the authors find 29 SRGs that could possibly have a cyclic adjacency code.

关 键 词：Cyclic codes strongly regular graphs adjacency codes self-orthogonal codes 

分 类 号：O157.5[理学—数学]