On the Number of Inequivalent Binary Self-Orthogonal Codes

Simple item page
dc.creatorHou, Xiang-dong
dc.date2007-02-05
dc.date.accessioned2026-07-07T07:44:49Z
dc.date.available2026-07-07T07:44:49Z
dc.descriptionLet $Ψ_{k,n}$ denote the number of inequivalent binary self-orthogonal $[n,k]$ codes. We present a method which allows us to compute $Ψ_{k,n}$ explicitly for a moderate $k$ and an arbitrary $n$. Included in this paper are explicit formulas for $Ψ_{k,n}$ with $k\le 5$.
dc.description41 pages
dc.identifierhttps://arxiv.org/abs/math/0702110
dc.identifierhttp://arxiv.org/abs/math/0702110
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/123339
dc.subjectCombinatorics
dc.subject05A15; 20B25
dc.titleOn the Number of Inequivalent Binary Self-Orthogonal Codes
dc.typetext

Files

Collections

arXiv