Isodual cyclic codes over finite fields of odd characteristic

详细信息    查看全文

• 作者：Adel Alahmadi^a ; ^{adelnife2@yahoo.com" class="auth_mail" title="E-mail the corresponding author} ; Safa Alsulami^a ; ^{safasas@hotmail.com" class="auth_mail" title="E-mail the corresponding author} ; Rola Hijazi^a ; ^{rhijazi@kau.edu.sa" class="auth_mail" title="E-mail the corresponding author} ; Patrick Solé ; ^b ; ^a ; ^{sole@enst.fr" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Formally self-dual codes ; Cyclic codes
• 刊名：Discrete Mathematics
• 出版年：2016
• 出版时间：6 January 2016
• 年：2016
• 卷：339
• 期：1
• 页码：344-353
• 全文大小：384 K

文摘

Cyclic isodual codes over class="mathmlsrc">class="formulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0012365X15003040&_mathId=si1.gif&_user=111111111&_pii=S0012365X15003040&_rdoc=1&_issn=0012365X&md5=e82941df8a770f87f429770769d745bd" title="Click to view the MathML source">F_qclass="mathContainer hidden">class="mathCode">${\mathbb{F}}_q$ are constructed in length class="mathmlsrc">title="View the MathML source" class="mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0012365X15003040&_mathId=si2.gif&_user=111111111&_pii=S0012365X15003040&_rdoc=1&_issn=0012365X&md5=f3c4cac6d9c1515f320b275aaff8f5f6">class="imgLazyJSB inlineImage" height="15" width="87" alt="View the MathML source" style="margin-top: -5px; vertical-align: middle" title="View the MathML source" src="/sd/grey_pxl.gif" data-inlimgeid="1-s2.0-S0012365X15003040-si2.gif">class="mathContainer hidden">class="mathCode">$\equiv 2(mod4)$, for odd class="mathmlsrc">class="formulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0012365X15003040&_mathId=si3.gif&_user=111111111&_pii=S0012365X15003040&_rdoc=1&_issn=0012365X&md5=e9af347056ff9d59fa999d4ca7d552b9" title="Click to view the MathML source">qclass="mathContainer hidden">class="mathCode">$q$, and in length class="mathmlsrc">title="View the MathML source" class="mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0012365X15003040&_mathId=si4.gif&_user=111111111&_pii=S0012365X15003040&_rdoc=1&_issn=0012365X&md5=e46a5260256db355f02e7dd1b629bf75">class="imgLazyJSB inlineImage" height="15" width="87" alt="View the MathML source" style="margin-top: -5px; vertical-align: middle" title="View the MathML source" src="/sd/grey_pxl.gif" data-inlimgeid="1-s2.0-S0012365X15003040-si4.gif">class="mathContainer hidden">class="mathCode">$\equiv 4(mod8)$, for class="mathmlsrc">title="View the MathML source" class="mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0012365X15003040&_mathId=si5.gif&_user=111111111&_pii=S0012365X15003040&_rdoc=1&_issn=0012365X&md5=f115cc94d0f9e2f783287c887824fb24">class="imgLazyJSB inlineImage" height="15" width="99" alt="View the MathML source" style="margin-top: -5px; vertical-align: middle" title="View the MathML source" src="/sd/grey_pxl.gif" data-inlimgeid="1-s2.0-S0012365X15003040-si5.gif">class="mathContainer hidden">class="mathCode">$q\equiv 1(mod4)$. Their minimum distance is computed in short lengths.