On the Number of Inequivalent Binary Self-Orthogonal Codes

DOI10.1109/TIT.2007.899542zbMATH Open1155.94403arXivmath/0702110MaRDI QIDQ3549019FDOQ3549019

Authors: Xiang-Dong Hou 

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Full work available at URL: https://arxiv.org/abs/math/0702110

Recommendations

• The number of inequivalent binary self-orthogonal codes of dimension 6
• On The Classification of Binary Optimal Self-Orthogonal Codes
• Classification of optimal binary self-orthognal codes
• On the asymptotic number of inequivalent binary self-dual codes
• Construction of binary and ternary self-orthogonal linear codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited In (10)

• The build-up construction over a commutative non-unital ring
• Type IV codes over a non-unital ring
• Type IV codes over a non-local non-unital ring
• The cardinality of classes of convolutional self-orthogonal codes with given parameters
• DNA codes over two noncommutative rings of order four
• On the asymptotic number of inequivalent binary self-dual codes
• Quasi type IV codes over a non-unital ring
• The build-up construction of quasi self-dual codes over a non-unital ring
• Classification of binary self-orthogonal codes of lengths from 16 to 20 and its application
• The number of inequivalent binary self-orthogonal codes of dimension 6

This page was built for publication: On the Number of Inequivalent Binary Self-Orthogonal Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549019)