Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 14 Jun 2021 in cs.IT and math.IT | (2106.07124v1)

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

Citations (6)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.