scientific article; zbMATH DE number 14398

From MaRDI portal
Publication:3976923





Let \(Z\) be a finite, abelian group, and let \(\mathcal C\) be a subgroup of \(Z^ n\). Thus, \(\mathcal C\) is an additive code. If the distance matrix of \(\mathcal C\) has \(s+ 1\) distinct rows, where \(s\) is the external distance of \(\mathcal C\), then \textit{P. Delsarte} [Philips Res. Rep. Suppl. No. 10 (1973)] defined an association scheme on the set of translates of \(\mathcal C\). The author generalizes this construction to the setting of Cayley graphs by using the path matrix as a replacement for the distance matrix. Namely, given a Cayley graph \(X\) on a finite group \(G\), and given a normal subgroup \(N\) of \(G\), the path matrix \(C\) is defined by letting \(C_{x,i}\) be the number of paths of length \(i\) that start at the vertex \(x\) of \(X\) and end in \(N\). Under appropriate hypotheses, the author constructs an association scheme on \(G/N\) by defining an equivalence relation on \(G/N\): two cosets \(xN\) and \(yN\) are equivalent if the corresponding rows of the path matrix are equal.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3976923)