Self-orthogonal codes over a non-unital ring and combinatorial matrices
arXiv:2106.07124
Abstract
There is a local ring of order without identity for the multiplication, defined by generators and relations as We study a special construction of self-orthogonal codes over based on combinatorial matrices related to two-class association schemes, Strongly Regular Graphs (SRG), and Doubly Regular Tournaments (DRT). We construct quasi self-dual codes over and Type IV codes, that is, quasi self-dual codes whose all codewords have even Hamming weight. All these codes can be represented as formally self-dual additive codes over $\F_4.$ The classical invariant theory bound for the weight enumerators of this class of codesimproves the known bound on the minimum distance of Type IV codes over
18 pages