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 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 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
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