Construction of binary and ternary self-orthogonal linear codes (Q1026113): Difference between revisions

The goal of this article is to construct new binary and ternary self-orthogonal linear codes, that is linear codes \(C\) such that \(C\subseteq C^{\perp}\). The existence of such codes having a prescribed minimum distance \(d\), is translated to the existence of solutions of a system of linear Diophantine equations. Since solving these systems is an NP hard problem, the authors try to find solutions by lattice point enumeration. In this way, the original problem is transferred to the problem of finding some vectors in a lattice. By using exhaustive computer search they find six new distance-optimal self-orthogonal codes.