On the Number of Inequivalent Binary Self-Orthogonal Codes

Abstract

Let ${\Psi }_{k,n}$ denote the number of inequivalent binary self-orthogonal $[n,k]$ codes. We present a method which allows us to compute ${\Psi }_{k,n}$ explicitly for a moderate $k$ and an arbitrary $n$. Included in this paper are explicit formulas for ${\Psi }_{k,n}$ with $k\le 5$.

41 pages