Xiang-dong Hou
Published 2007-02-05Version 1
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$.
Explicit formulas for enumeration of lattice paths: basketball and the kernel method
Explicit formulas for a family of hypermaps beyond the one-face case
Labelled and unlabelled enumeration of $k$-gonal 2-trees
![QR code for arXiv:math/0702110 [math.CO]](http://oss.arxitics.com/images/favicon.svg)