Linear ternary codes of strongly regular signed graphs

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.