<p>Let <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\({\mathscr {R}}_{e,m}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="script">R</mi> <mrow> <mi>e</mi> <mo>,</mo> <mi>m</mi> </mrow> </msub> </math></EquationSource> </InlineEquation> denote a finite commutative chain ring of even characteristic with maximal ideal <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\langle u \rangle \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">⟨</mo> <mi>u</mi> <mo stretchy="false">⟩</mo> </mrow> </math></EquationSource> </InlineEquation> of nilpotency index <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(e \ge 3,\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>e</mi> <mo>≥</mo> <mn>3</mn> <mo>,</mo> </mrow> </math></EquationSource> </InlineEquation> Teichm<InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\ddot{u}\)</EquationSource> <EquationSource Format="MATHML"><math> <mover accent="true"> <mi>u</mi> <mo>¨</mo> </mover> </math></EquationSource> </InlineEquation>ller set <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\({\mathcal {T}}_{m},\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="script">T</mi> <mi>m</mi> </msub> <mo>,</mo> </mrow> </math></EquationSource> </InlineEquation> and residue field <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\({\mathscr {R}}_{e,m}/\langle u \rangle \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="script">R</mi> <mrow> <mi>e</mi> <mo>,</mo> <mi>m</mi> </mrow> </msub> <mo stretchy="false">/</mo> <mrow> <mo stretchy="false">⟨</mo> <mi>u</mi> <mo stretchy="false">⟩</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> of order <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(2^m.\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mn>2</mn> <mi>m</mi> </msup> <mo>.</mo> </mrow> </math></EquationSource> </InlineEquation> Suppose that <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(2 \in \langle u^{\kappa }\rangle \setminus \langle u^{\kappa +1}\rangle \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>2</mn> <mo>∈</mo> <mrow> <mo stretchy="false">⟨</mo> <msup> <mi>u</mi> <mi>κ</mi> </msup> <mo stretchy="false">⟩</mo> </mrow> <mo lspace="0.15em" rspace="0.15em" stretchy="false">\</mo> <mrow> <mo stretchy="false">⟨</mo> <msup> <mi>u</mi> <mrow> <mi>κ</mi> <mo>+</mo> <mn>1</mn> </mrow> </msup> <mo stretchy="false">⟩</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> for some odd integer <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(\kappa \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>κ</mi> </math></EquationSource> </InlineEquation> with <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(3 \le \kappa \le e.\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>3</mn> <mo>≤</mo> <mi>κ</mi> <mo>≤</mo> <mi>e</mi> <mo>.</mo> </mrow> </math></EquationSource> </InlineEquation> In this paper, we first develop a recursive method to construct a self-orthogonal code <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\({\mathscr {D}}_e\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="script">D</mi> <mi>e</mi> </msub> </math></EquationSource> </InlineEquation> of type <InlineEquation ID="IEq12"> <EquationSource Format="TEX">\(\{\lambda _1, \lambda _2, \ldots , \lambda _e\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">{</mo> <msub> <mi>λ</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>λ</mi> <mn>2</mn> </msub> <mo>,</mo> <mo>…</mo> <mo>,</mo> <msub> <mi>λ</mi> <mi>e</mi> </msub> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation> and length <i>n</i> over <InlineEquation ID="IEq13"> <EquationSource Format="TEX">\({\mathscr {R}}_{e,m}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="script">R</mi> <mrow> <mi>e</mi> <mo>,</mo> <mi>m</mi> </mrow> </msub> </math></EquationSource> </InlineEquation> from a chain <InlineEquation ID="IEq14"> <EquationSource Format="TEX">\({\mathcal {C}}^{(1)}\subseteq {\mathcal {C}}^{(2)} \subseteq \cdots \subseteq {\mathcal {C}}^{(\lceil \frac{e}{2}\rceil )} \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mrow> <mi mathvariant="script">C</mi> </mrow> <mrow> <mo stretchy="false">(</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> </msup> <mo>⊆</mo> <msup> <mrow> <mi mathvariant="script">C</mi> </mrow> <mrow> <mo stretchy="false">(</mo> <mn>2</mn> <mo stretchy="false">)</mo> </mrow> </msup> <mo>⊆</mo> <mo>⋯</mo> <mo>⊆</mo> <msup> <mrow> <mi mathvariant="script">C</mi> </mrow> <mrow> <mo stretchy="false">(</mo> <mrow> <mo>⌈</mo> <mfrac> <mi>e</mi> <mn>2</mn> </mfrac> <mo>⌉</mo> </mrow> <mo stretchy="false">)</mo> </mrow> </msup> </mrow> </math></EquationSource> </InlineEquation> of self-orthogonal codes of length <i>n</i> over <InlineEquation ID="IEq15"> <EquationSource Format="TEX">\({\mathcal {T}}_{m},\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="script">T</mi> <mi>m</mi> </msub> <mo>,</mo> </mrow> </math></EquationSource> </InlineEquation> and vice versa, subject to the following conditions: <OrderedList> <ListItem> <ItemNumber>(i)</ItemNumber> <ItemContent> <p><InlineEquation ID="IEq16"> <EquationSource Format="TEX">\(\dim {\mathcal {C}}^{(i)}=\lambda _1+\lambda _2+\cdots +\lambda _i\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>dim</mo> <msup> <mrow> <mi mathvariant="script">C</mi> </mrow> <mrow> <mo stretchy="false">(</mo> <mi>i</mi> <mo stretchy="false">)</mo> </mrow> </msup> <mo>=</mo> <msub> <mi>λ</mi> <mn>1</mn> </msub> <mo>+</mo> <msub> <mi>λ</mi> <mn>2</mn> </msub> <mo>+</mo> <mo>⋯</mo> <mo>+</mo> <msub> <mi>λ</mi> <mi>i</mi> </msub> </mrow> </math></EquationSource> </InlineEquation> for <InlineEquation ID="IEq17"> <EquationSource Format="TEX">\(1 \le i \le \lceil \frac{e}{2}\rceil ;\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>1</mn> <mo>≤</mo> <mi>i</mi> <mo>≤</mo> <mo>⌈</mo> <mfrac> <mi>e</mi> <mn>2</mn> </mfrac> <mo>⌉</mo> <mo>;</mo> </mrow> </math></EquationSource> </InlineEquation></p> </ItemContent> </ListItem> <ListItem> <ItemNumber>(ii)</ItemNumber> <ItemContent> <p>the code <InlineEquation ID="IEq18"> <EquationSource Format="TEX">\({\mathcal {C}}^{({\lfloor \frac{e}{2}\rfloor }-{\lfloor \frac{\kappa }{2}\rfloor })}\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mrow> <mi mathvariant="script">C</mi> </mrow> <mrow> <mo stretchy="false">(</mo> <mrow> <mo>⌊</mo> <mfrac> <mi>e</mi> <mn>2</mn> </mfrac> <mo>⌋</mo> </mrow> <mo>-</mo> <mrow> <mo>⌊</mo> <mfrac> <mi>κ</mi> <mn>2</mn> </mfrac> <mo>⌋</mo> </mrow> <mo stretchy="false">)</mo> </mrow> </msup> </math></EquationSource> </InlineEquation> is doubly even; and</p> </ItemContent> </ListItem> <ListItem> <ItemNumber>(iii)</ItemNumber> <ItemContent> <p>the all-one vector <InlineEquation ID="IEq19"> <EquationSource Format="TEX">\({\textbf {1}} =(1,1,\ldots ,1)\notin {\mathcal {C}}^{(\lceil \frac{e}{2}\rceil -\kappa )}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn mathvariant="bold">1</mn> <mo>=</mo> <mrow> <mo stretchy="false">(</mo> <mn>1</mn> <mo>,</mo> <mn>1</mn> <mo>,</mo> <mo>…</mo> <mo>,</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> <mo>∉</mo> <msup> <mrow> <mi mathvariant="script">C</mi> </mrow> <mrow> <mo stretchy="false">(</mo> <mrow> <mo>⌈</mo> <mfrac> <mi>e</mi> <mn>2</mn> </mfrac> <mo>⌉</mo> </mrow> <mo>-</mo> <mi>κ</mi> <mo stretchy="false">)</mo> </mrow> </msup> </mrow> </math></EquationSource> </InlineEquation> provided that <InlineEquation ID="IEq20"> <EquationSource Format="TEX">\(2\kappa \le e,\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>2</mn> <mi>κ</mi> <mo>≤</mo> <mi>e</mi> <mo>,</mo> </mrow> </math></EquationSource> </InlineEquation> <InlineEquation ID="IEq21"> <EquationSource Format="TEX">\(n\equiv 4\pmod 8\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≡</mo> <mn>4</mn> <mspace width="4.44443pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>8</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> and <i>m</i> is odd,</p> </ItemContent> </ListItem> </OrderedList> where <InlineEquation ID="IEq22"> <EquationSource Format="TEX">\(\lambda _1,\lambda _2,\ldots ,\lambda _e\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>λ</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>λ</mi> <mn>2</mn> </msub> <mo>,</mo> <mo>…</mo> <mo>,</mo> <msub> <mi>λ</mi> <mi>e</mi> </msub> </mrow> </math></EquationSource> </InlineEquation> are non-negative integers satisfying <InlineEquation ID="IEq23"> <EquationSource Format="TEX">\(2\lambda _1+2\lambda _2+\cdots +2\lambda _{e-i+1}+\lambda _{e-i+2}+\lambda _{e-i+3}+\cdots +\lambda _i \le n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>2</mn> <msub> <mi>λ</mi> <mn>1</mn> </msub> <mo>+</mo> <mn>2</mn> <msub> <mi>λ</mi> <mn>2</mn> </msub> <mo>+</mo> <mo>⋯</mo> <mo>+</mo> <mn>2</mn> <msub> <mi>λ</mi> <mrow> <mi>e</mi> <mo>-</mo> <mi>i</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>+</mo> <msub> <mi>λ</mi> <mrow> <mi>e</mi> <mo>-</mo> <mi>i</mi> <mo>+</mo> <mn>2</mn> </mrow> </msub> <mo>+</mo> <msub> <mi>λ</mi> <mrow> <mi>e</mi> <mo>-</mo> <mi>i</mi> <mo>+</mo> <mn>3</mn> </mrow> </msub> <mo>+</mo> <mo>⋯</mo> <mo>+</mo> <msub> <mi>λ</mi> <mi>i</mi> </msub> <mo>≤</mo> <mi>n</mi> </mrow> </math></EquationSource> </InlineEquation> for <InlineEquation ID="IEq24"> <EquationSource Format="TEX">\(\lceil \frac{e+1}{2}\rceil \le i\le e,\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>⌈</mo> <mfrac> <mrow> <mi>e</mi> <mo>+</mo> <mn>1</mn> </mrow> <mn>2</mn> </mfrac> <mo>⌉</mo> <mo>≤</mo> <mi>i</mi> <mo>≤</mo> <mi>e</mi> <mo>,</mo> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq25"> <EquationSource Format="TEX">\(\lfloor \cdot \rfloor \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>⌊</mo> <mo>·</mo> <mo>⌋</mo> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq26"> <EquationSource Format="TEX">\(\lceil \cdot \rceil \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>⌈</mo> <mo>·</mo> <mo>⌉</mo> </mrow> </math></EquationSource> </InlineEquation> denote the floor and ceiling functions, respectively. This construction ensures that <InlineEquation ID="IEq27"> <EquationSource Format="TEX">\(Tor_i({\mathscr {D}}_e)={\mathcal {C}}^{(i)}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>T</mi> <mi>o</mi> <msub> <mi>r</mi> <mi>i</mi> </msub> <mrow> <mo stretchy="false">(</mo> <msub> <mi mathvariant="script">D</mi> <mi>e</mi> </msub> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <msup> <mrow> <mi mathvariant="script">C</mi> </mrow> <mrow> <mo stretchy="false">(</mo> <mi>i</mi> <mo stretchy="false">)</mo> </mrow> </msup> </mrow> </math></EquationSource> </InlineEquation> for <InlineEquation ID="IEq28"> <EquationSource Format="TEX">\(1 \le i \le \lceil \frac{e}{2}\rceil .\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>1</mn> <mo>≤</mo> <mi>i</mi> <mo>≤</mo> <mo>⌈</mo> <mfrac> <mi>e</mi> <mn>2</mn> </mfrac> <mo>⌉</mo> <mo>.</mo> </mrow> </math></EquationSource> </InlineEquation> With the help of this recursive construction method and by applying results from group theory and finite geometry, we obtain explicit enumeration formulae for all self-orthogonal and self-dual codes of an arbitrary length over <InlineEquation ID="IEq29"> <EquationSource Format="TEX">\({\mathscr {R}}_{e,m}.\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="script">R</mi> <mrow> <mi>e</mi> <mo>,</mo> <mi>m</mi> </mrow> </msub> <mo>.</mo> </mrow> </math></EquationSource> </InlineEquation> We also illustrate these results with some examples. In a subsequent study [<CitationRef CitationID="CR33">33</CitationRef>], we will address the complementary case where <InlineEquation ID="IEq30"> <EquationSource Format="TEX">\(\kappa \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>κ</mi> </math></EquationSource> </InlineEquation> is even.</p>

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

Recursive construction and enumeration of self-orthogonal and self-dual codes over finite commutative chain rings of even characteristic

  • Monika Yadav,
  • Anuradha Sharma

摘要

Let \({\mathscr {R}}_{e,m}\) R e , m denote a finite commutative chain ring of even characteristic with maximal ideal \(\langle u \rangle \) u of nilpotency index \(e \ge 3,\) e 3 , Teichm \(\ddot{u}\) u ¨ ller set \({\mathcal {T}}_{m},\) T m , and residue field \({\mathscr {R}}_{e,m}/\langle u \rangle \) R e , m / u of order \(2^m.\) 2 m . Suppose that \(2 \in \langle u^{\kappa }\rangle \setminus \langle u^{\kappa +1}\rangle \) 2 u κ \ u κ + 1 for some odd integer \(\kappa \) κ with \(3 \le \kappa \le e.\) 3 κ e . In this paper, we first develop a recursive method to construct a self-orthogonal code \({\mathscr {D}}_e\) D e of type \(\{\lambda _1, \lambda _2, \ldots , \lambda _e\}\) { λ 1 , λ 2 , , λ e } and length n over \({\mathscr {R}}_{e,m}\) R e , m from a chain \({\mathcal {C}}^{(1)}\subseteq {\mathcal {C}}^{(2)} \subseteq \cdots \subseteq {\mathcal {C}}^{(\lceil \frac{e}{2}\rceil )} \) C ( 1 ) C ( 2 ) C ( e 2 ) of self-orthogonal codes of length n over \({\mathcal {T}}_{m},\) T m , and vice versa, subject to the following conditions: (i)

\(\dim {\mathcal {C}}^{(i)}=\lambda _1+\lambda _2+\cdots +\lambda _i\) dim C ( i ) = λ 1 + λ 2 + + λ i for \(1 \le i \le \lceil \frac{e}{2}\rceil ;\) 1 i e 2 ;

(ii)

the code \({\mathcal {C}}^{({\lfloor \frac{e}{2}\rfloor }-{\lfloor \frac{\kappa }{2}\rfloor })}\) C ( e 2 - κ 2 ) is doubly even; and

(iii)

the all-one vector \({\textbf {1}} =(1,1,\ldots ,1)\notin {\mathcal {C}}^{(\lceil \frac{e}{2}\rceil -\kappa )}\) 1 = ( 1 , 1 , , 1 ) C ( e 2 - κ ) provided that \(2\kappa \le e,\) 2 κ e , \(n\equiv 4\pmod 8\) n 4 ( mod 8 ) and m is odd,

where \(\lambda _1,\lambda _2,\ldots ,\lambda _e\) λ 1 , λ 2 , , λ e are non-negative integers satisfying \(2\lambda _1+2\lambda _2+\cdots +2\lambda _{e-i+1}+\lambda _{e-i+2}+\lambda _{e-i+3}+\cdots +\lambda _i \le n\) 2 λ 1 + 2 λ 2 + + 2 λ e - i + 1 + λ e - i + 2 + λ e - i + 3 + + λ i n for \(\lceil \frac{e+1}{2}\rceil \le i\le e,\) e + 1 2 i e , and \(\lfloor \cdot \rfloor \) · and \(\lceil \cdot \rceil \) · denote the floor and ceiling functions, respectively. This construction ensures that \(Tor_i({\mathscr {D}}_e)={\mathcal {C}}^{(i)}\) T o r i ( D e ) = C ( i ) for \(1 \le i \le \lceil \frac{e}{2}\rceil .\) 1 i e 2 . With the help of this recursive construction method and by applying results from group theory and finite geometry, we obtain explicit enumeration formulae for all self-orthogonal and self-dual codes of an arbitrary length over \({\mathscr {R}}_{e,m}.\) R e , m . We also illustrate these results with some examples. In a subsequent study [33], we will address the complementary case where \(\kappa \) κ is even.