<p>Let <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\mathcal {C}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">C</mi> </math></EquationSource> </InlineEquation> be a quasi-cyclic code of index <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\ell \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>ℓ</mi> </math></EquationSource> </InlineEquation> <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\((\ell \ge 2)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mi>ℓ</mi> <mo>≥</mo> <mn>2</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> and co-index <i>m</i> over finite field <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\mathbb {F}_q\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="double-struck">F</mi> <mi>q</mi> </msub> </math></EquationSource> </InlineEquation>. Let <i>G</i> be the subgroup of the automorphism group of <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(\mathcal {C}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">C</mi> </math></EquationSource> </InlineEquation> generated by <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(\rho ^\ell \)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mi>ρ</mi> <mi>ℓ</mi> </msup> </math></EquationSource> </InlineEquation> and the scalar multiplications of <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(\mathcal {C}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">C</mi> </math></EquationSource> </InlineEquation>, where <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(\rho \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>ρ</mi> </math></EquationSource> </InlineEquation> denotes the standard cyclic shift. In this paper, we find an explicit formula for the number of orbits of <i>G</i> on <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(\mathcal {C}\setminus \{\textbf{0}\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">C</mi> <mo lspace="0.15em" rspace="0.15em" stretchy="false">\</mo> <mo stretchy="false">{</mo> <mn mathvariant="bold">0</mn> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation>. Consequently, an explicit upper bound on the number of nonzero weights of <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(\mathcal {C}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">C</mi> </math></EquationSource> </InlineEquation> is immediately derived and a necessary and sufficient condition for codes meeting the bound is exhibited. The map <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(\mu _q: x \mapsto x^q\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>μ</mi> <mi>q</mi> </msub> <mo>:</mo> <mi>x</mi> <mo>↦</mo> <msup> <mi>x</mi> <mi>q</mi> </msup> </mrow> </math></EquationSource> </InlineEquation> is a ring isomorphism from <InlineEquation ID="IEq12"> <EquationSource Format="TEX">\(R_m\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>R</mi> <mi>m</mi> </msub> </math></EquationSource> </InlineEquation> onto itself, where <InlineEquation ID="IEq13"> <EquationSource Format="TEX">\(R_m=\mathbb {F}_q[x]/\langle x^m-1\rangle \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>R</mi> <mi>m</mi> </msub> <mo>=</mo> <msub> <mi mathvariant="double-struck">F</mi> <mi>q</mi> </msub> <mrow> <mo stretchy="false">[</mo> <mi>x</mi> <mo stretchy="false">]</mo> </mrow> <mo stretchy="false">/</mo> <mrow> <mo stretchy="false">⟨</mo> <msup> <mi>x</mi> <mi>m</mi> </msup> <mo>-</mo> <mn>1</mn> <mo stretchy="false">⟩</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>. It can be extended to <InlineEquation ID="IEq14"> <EquationSource Format="TEX">\(R^\ell _m\)</EquationSource> <EquationSource Format="MATHML"><math> <msubsup> <mi>R</mi> <mi>m</mi> <mi>ℓ</mi> </msubsup> </math></EquationSource> </InlineEquation> componentwise. If <InlineEquation ID="IEq15"> <EquationSource Format="TEX">\(\mathcal {C}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">C</mi> </math></EquationSource> </InlineEquation> is a one-generator quasi-cyclic code, a tighter upper bound on the number of nonzero weights of <InlineEquation ID="IEq16"> <EquationSource Format="TEX">\(\mathcal {C}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">C</mi> </math></EquationSource> </InlineEquation> is obtained by considering a larger automorphism subgroup which is generated by the multiplier <InlineEquation ID="IEq17"> <EquationSource Format="TEX">\(\mu _q\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>μ</mi> <mi>q</mi> </msub> </math></EquationSource> </InlineEquation>, <InlineEquation ID="IEq18"> <EquationSource Format="TEX">\(\rho ^\ell \)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mi>ρ</mi> <mi>ℓ</mi> </msup> </math></EquationSource> </InlineEquation>, and the scalar multiplications of <InlineEquation ID="IEq19"> <EquationSource Format="TEX">\(\mathcal {C}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">C</mi> </math></EquationSource> </InlineEquation>. In particular, we list some examples to show the bounds are tight.</p>

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

A tight upper bound on the number of nonzero weights of a quasi-cyclic code

  • Xiaoxiao Li,
  • Minjia Shi,
  • San Ling

摘要

Let \(\mathcal {C}\) C be a quasi-cyclic code of index \(\ell \) \((\ell \ge 2)\) ( 2 ) and co-index m over finite field \(\mathbb {F}_q\) F q . Let G be the subgroup of the automorphism group of \(\mathcal {C}\) C generated by \(\rho ^\ell \) ρ and the scalar multiplications of \(\mathcal {C}\) C , where \(\rho \) ρ denotes the standard cyclic shift. In this paper, we find an explicit formula for the number of orbits of G on \(\mathcal {C}\setminus \{\textbf{0}\}\) C \ { 0 } . Consequently, an explicit upper bound on the number of nonzero weights of \(\mathcal {C}\) C is immediately derived and a necessary and sufficient condition for codes meeting the bound is exhibited. The map \(\mu _q: x \mapsto x^q\) μ q : x x q is a ring isomorphism from \(R_m\) R m onto itself, where \(R_m=\mathbb {F}_q[x]/\langle x^m-1\rangle \) R m = F q [ x ] / x m - 1 . It can be extended to \(R^\ell _m\) R m componentwise. If \(\mathcal {C}\) C is a one-generator quasi-cyclic code, a tighter upper bound on the number of nonzero weights of \(\mathcal {C}\) C is obtained by considering a larger automorphism subgroup which is generated by the multiplier \(\mu _q\) μ q , \(\rho ^\ell \) ρ , and the scalar multiplications of \(\mathcal {C}\) C . In particular, we list some examples to show the bounds are tight.