English

Self-orthogonal codes over a non-unital ring and combinatorial matrices

Information Theory 2021-06-15 v1 math.IT

Abstract

There is a local ring EE of order 4,4, without identity for the multiplication, defined by generators and relations as E=a,b2a=2b=0,a2=a,b2=b,ab=a,ba=b.E=\langle a,b \mid 2a=2b=0,\, a^2=a,\, b^2=b,\,ab=a,\, ba=b\rangle. We study a special construction of self-orthogonal codes over E,E, 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 E,E, 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 \F4.\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 E.E.

Keywords

Cite

@article{arxiv.2106.07124,
  title  = {Self-orthogonal codes over a non-unital ring and combinatorial matrices},
  author = {Minjia Shi and Shukai Wang and Jon-Lark Kim and Patrick Solé},
  journal= {arXiv preprint arXiv:2106.07124},
  year   = {2021}
}

Comments

18 pages

R2 v1 2026-06-24T03:09:17.503Z