Self-orthogonal codes over a non-unital ring from two class association schemes (Q6580202)

Let \(I=\langle a,b:~2a=2b=0,a^2=b,ab=0 \rangle\) be a non-unital ring consists of four elements \(\{0,a,b,c\},\) with \(c=a+b,\) and has characteristic two. Its multiplicative table is given by\N\[\N\begin{array}{c| c c c c} \hline \times & 0 & a & b & c\\\N\hline 0 & 0 & 0 & 0 & 0\\\Na & 0 & b & 0 & b\\\Nb & 0 & 0 & 0 & 0\\\Nc & 0 & b & 0 & b\\\N\hline \end{array}.\N\]\NFrom the table above, we see that \(I\) is a commutative ring without a multiplicative identity.\N\NThe purpose of the paper under review is to provide special constructions of linear codes over \(I\) from the adjacency matrices of \(2\)-class association schemes \(\mathfrak{X} =(X,\{R_0,R_1,R_2\})=(X,\{A_0=I,A_1,A_2\}).\) There are two cases may occur. Either \(A_1^T=A_1,\) \(A_2^T=A_2\) and then the undirected graph \((X,R_1)\) is a strongly regular graph; or \(A_1^T=A_2,\) \(A_2^T=A_1,\) and the directed graph \((X,R_1)\) is a doubly regular tournament. The methods of construction itself are very much inspired by the work of \textit{S. T. Dougherty} et al. [Adv. Math. Commun. 1, No. 1, 45--64 (2007; Zbl 1107.94015)].\N\NThe authors also investigate the conditions under which these codes are self-orthogonal, quasi self-dual, or Type \(IV.\) Some examples of codes with minimum distance better than that of Type \(IV\) codes over unital rings of the same order in modest lengths are given.