Codes from orbit matrices of strongly regular graphs

Sa？etak We show that under certain conditions submatrices of orbit matrices of strongly regular graphs span self-orthogonal codes. In order to demonstrate this method of construction, we construct self-orthogonal binary linear codes from orbit matrices of the triangular graphs T(2k) with at most 120 vertices. Further, we obtain strongly regular graphs and block designs from codewords of the constructed codes