<p>There are four commutative unital rings of order four. Among them, we consider the ring <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(R=\mathbb {F}_{2}+u\mathbb {F}_{2}= \left\{ 0,1,u,\bar{u}=u+1\right\} \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>R</mi> <mo>=</mo> <msub> <mi mathvariant="double-struck">F</mi> <mn>2</mn> </msub> <mo>+</mo> <mi>u</mi> <msub> <mi mathvariant="double-struck">F</mi> <mn>2</mn> </msub> <mo>=</mo> <mfenced close="}" open="{"> <mn>0</mn> <mo>,</mo> <mn>1</mn> <mo>,</mo> <mi>u</mi> <mo>,</mo> <mover accent="true"> <mrow> <mi>u</mi> </mrow> <mrow> <mo stretchy="false">¯</mo> </mrow> </mover> <mo>=</mo> <mi>u</mi> <mo>+</mo> <mn>1</mn> </mfenced> </mrow> </math></EquationSource> </InlineEquation> where <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(u^2=0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>u</mi> <mn>2</mn> </msup> <mo>=</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation>, which is a commutative ring with characteristic 2. In this paper, we study linear complementary dual (LCD) codes over the ring <i>R</i>. We first define <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\({\text{ LCD }}[n,k]_{R}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mrow> <mspace width="0.333333em" /> <mtext>LCD</mtext> <mspace width="0.333333em" /> </mrow> <msub> <mrow> <mo stretchy="false">[</mo> <mi>n</mi> <mo>,</mo> <mi>k</mi> <mo stretchy="false">]</mo> </mrow> <mi>R</mi> </msub> </mrow> </math></EquationSource> </InlineEquation>, which denotes the maximum of possible values of <i>d</i> among free [<i>n</i>,&#xa0;<i>k</i>,&#xa0;<i>d</i>] LCD codes over <i>R</i>, and obtain a Griesmer type bound for linear codes over <i>R</i>. We get an upper bound for <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\({\text{ LCD }}[n,2]_{R}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mrow> <mspace width="0.333333em" /> <mtext>LCD</mtext> <mspace width="0.333333em" /> </mrow> <msub> <mrow> <mo stretchy="false">[</mo> <mi>n</mi> <mo>,</mo> <mn>2</mn> <mo stretchy="false">]</mo> </mrow> <mi>R</mi> </msub> </mrow> </math></EquationSource> </InlineEquation>, and further show that <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\({\text{ LCD }}[n,2]_{R}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mrow> <mspace width="0.333333em" /> <mtext>LCD</mtext> <mspace width="0.333333em" /> </mrow> <msub> <mrow> <mo stretchy="false">[</mo> <mi>n</mi> <mo>,</mo> <mn>2</mn> <mo stretchy="false">]</mo> </mrow> <mi>R</mi> </msub> </mrow> </math></EquationSource> </InlineEquation> with the exception of <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(n\equiv 0, -1 \; (\textrm{mod} \; \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≡</mo> <mn>0</mn> <mo>,</mo> <mo>-</mo> <mn>1</mn> <mspace width="0.277778em" /> <mo stretchy="false">(</mo> <mtext>mod</mtext> <mspace width="0.277778em" /> </mrow> </math></EquationSource> </InlineEquation>6) meets the upper bound exactly. For <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(k=3\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>k</mi> <mo>=</mo> <mn>3</mn> </mrow> </math></EquationSource> </InlineEquation>, we also get an upper bound for <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\({\text{ LCD }}[n,3]_{R}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mrow> <mspace width="0.333333em" /> <mtext>LCD</mtext> <mspace width="0.333333em" /> </mrow> <msub> <mrow> <mo stretchy="false">[</mo> <mi>n</mi> <mo>,</mo> <mn>3</mn> <mo stretchy="false">]</mo> </mrow> <mi>R</mi> </msub> </mrow> </math></EquationSource> </InlineEquation>. Then we show that <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\({\text{ LCD }}[n,3]_{R}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mrow> <mspace width="0.333333em" /> <mtext>LCD</mtext> <mspace width="0.333333em" /> </mrow> <msub> <mrow> <mo stretchy="false">[</mo> <mi>n</mi> <mo>,</mo> <mn>3</mn> <mo stretchy="false">]</mo> </mrow> <mi>R</mi> </msub> </mrow> </math></EquationSource> </InlineEquation> meets the upper bound exactly for <InlineEquation ID="IEq12"> <EquationSource Format="TEX">\(n\equiv 3, 5\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≡</mo> <mn>3</mn> <mo>,</mo> <mn>5</mn> </mrow> </math></EquationSource> </InlineEquation> (mod 7). We also derive bounds of <InlineEquation ID="IEq13"> <EquationSource Format="TEX">\({\text{ LCD }}[n,k]_{R}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mrow> <mspace width="0.333333em" /> <mtext>LCD</mtext> <mspace width="0.333333em" /> </mrow> <msub> <mrow> <mo stretchy="false">[</mo> <mi>n</mi> <mo>,</mo> <mi>k</mi> <mo stretchy="false">]</mo> </mrow> <mi>R</mi> </msub> </mrow> </math></EquationSource> </InlineEquation> for <InlineEquation ID="IEq14"> <EquationSource Format="TEX">\(k=4, 5\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>k</mi> <mo>=</mo> <mn>4</mn> <mo>,</mo> <mn>5</mn> </mrow> </math></EquationSource> </InlineEquation> from the binary cases. Furthermore, we obtain the exact value of <InlineEquation ID="IEq15"> <EquationSource Format="TEX">\({\text{ LCD }}[n,n-i]_{R}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mrow> <mspace width="0.333333em" /> <mtext>LCD</mtext> <mspace width="0.333333em" /> </mrow> <msub> <mrow> <mo stretchy="false">[</mo> <mi>n</mi> <mo>,</mo> <mi>n</mi> <mo>-</mo> <mi>i</mi> <mo stretchy="false">]</mo> </mrow> <mi>R</mi> </msub> </mrow> </math></EquationSource> </InlineEquation> for <i>i</i> greater than or equal to two using the sphere packing bound.</p>

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

Lcd codes over \(\mathbb {F}_{2}+u\mathbb {F}_{2}\) with small dimensions

  • Jon-Lark Kim,
  • Young Gun Roe

摘要

There are four commutative unital rings of order four. Among them, we consider the ring \(R=\mathbb {F}_{2}+u\mathbb {F}_{2}= \left\{ 0,1,u,\bar{u}=u+1\right\} \) R = F 2 + u F 2 = 0 , 1 , u , u ¯ = u + 1 where \(u^2=0\) u 2 = 0 , which is a commutative ring with characteristic 2. In this paper, we study linear complementary dual (LCD) codes over the ring R. We first define \({\text{ LCD }}[n,k]_{R}\) LCD [ n , k ] R , which denotes the maximum of possible values of d among free [nkd] LCD codes over R, and obtain a Griesmer type bound for linear codes over R. We get an upper bound for \({\text{ LCD }}[n,2]_{R}\) LCD [ n , 2 ] R , and further show that \({\text{ LCD }}[n,2]_{R}\) LCD [ n , 2 ] R with the exception of \(n\equiv 0, -1 \; (\textrm{mod} \; \) n 0 , - 1 ( mod 6) meets the upper bound exactly. For \(k=3\) k = 3 , we also get an upper bound for \({\text{ LCD }}[n,3]_{R}\) LCD [ n , 3 ] R . Then we show that \({\text{ LCD }}[n,3]_{R}\) LCD [ n , 3 ] R meets the upper bound exactly for \(n\equiv 3, 5\) n 3 , 5 (mod 7). We also derive bounds of \({\text{ LCD }}[n,k]_{R}\) LCD [ n , k ] R for \(k=4, 5\) k = 4 , 5 from the binary cases. Furthermore, we obtain the exact value of \({\text{ LCD }}[n,n-i]_{R}\) LCD [ n , n - i ] R for i greater than or equal to two using the sphere packing bound.