engleski

Self-orthogonal codes from equitable partitions of distance-regular graphs

We give two methods for a construction of self- orthogonal codes using equitable partitions of distance-regular graphs. In the case of 2-class association schemes one of the methods coincides with the construction from strongly regular graphs, and in the case when all cells of the partition are of the same size it coincides with the construction of self- orthogonal codes from equitable partitions of association schemes. We apply these methods to construct self- orthogonal codes from some distance-regular graphs.

self-orthogonal code, distance-regular graph

nije evidentirano