<p>Self-dual binary linear codes have been extensively studied and classified for length <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(n\le 40\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≤</mo> <mn>40</mn> </mrow> </math></EquationSource> </InlineEquation>. However, little attention has been paid to linear codes that coincide with their orthogonal complement when the underlying inner product is not the dot product. In this paper, we introduce an alternating form defined on <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\mathbb {F}_2^n\)</EquationSource> <EquationSource Format="MATHML"><math> <msubsup> <mi mathvariant="double-struck">F</mi> <mn>2</mn> <mi>n</mi> </msubsup> </math></EquationSource> </InlineEquation> and study codes that are maximal totally isotropic with respect to this form. We classify such codes for <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(n\le 30\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≤</mo> <mn>30</mn> </mrow> </math></EquationSource> </InlineEquation> and present a MacWilliams-type identity which relates the weight enumerator of a linear code and that of its orthogonal complement with respect to our alternating inner product. As an application, we derive constraints on the weight enumerators of maximal totally isotropic codes.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

On binary codes that are maximal totally isotropic subspaces with respect to an alternating form

  • Patrick King,
  • Mikhail Kochetov

摘要

Self-dual binary linear codes have been extensively studied and classified for length \(n\le 40\) n 40 . However, little attention has been paid to linear codes that coincide with their orthogonal complement when the underlying inner product is not the dot product. In this paper, we introduce an alternating form defined on \(\mathbb {F}_2^n\) F 2 n and study codes that are maximal totally isotropic with respect to this form. We classify such codes for \(n\le 30\) n 30 and present a MacWilliams-type identity which relates the weight enumerator of a linear code and that of its orthogonal complement with respect to our alternating inner product. As an application, we derive constraints on the weight enumerators of maximal totally isotropic codes.