首页 > 最新文献

Journal of Algebra Combinatorics Discrete Structures and Applications最新文献

英文 中文
Non-existence of some 4-dimensional Griesmer codes over finite fields 有限域上某些4维Griesmer码的不存在性
Q3 Mathematics Pub Date : 2018-05-28 DOI: 10.13069/jacodesmath.427968
Kazuki Kumegawa, T. Maruta
We prove the non--existence of $[g_q(4,d),4,d]_q$ codes for $d=2q^3-rq^2-2q+1$ for $3 le r le (q+1)/2$, $q ge 5$; $d=2q^3-3q^2-3q+1$ for $q ge 9$; $d=2q^3-4q^2-3q+1$ for $q ge 9$; and $d=q^3-q^2-rq-2$ with $r=4, 5$ or $6$ for $q ge 9$, where $g_q(4,d)=sum_{i=0}^{3} leftlceil d/q^i rightrceil$. This yields that $n_q(4,d) = g_q(4,d)+1$ for $2q^3-3q^2-3q+1 le d le 2q^3-3q^2$, $2q^3-5q^2-2q+1 le d le 2q^3-5q^2$ and $q^3-q^2-rq-2 le d le q^3-q^2-rq$ with $4 le r le 6$ for $q ge 9$ and that $n_q(4,d) ge g_q(4,d)+1$ for $2q^3-rq^2-2q+1 le d le 2q^3-rq^2-q$ for $3 le r le (q+1)/2$, $q ge 5$ and $2q^3-4q^2-3q+1 le d le 2q^3-4q^2-2q$ for $q ge 9$, where $n_q(4,d)$ denotes the minimum length $n$ for which an $[n,4,d]_q$ code exists.
我们证明的不存在 $[g_q(4,d),4,d]_q$ 代码 $d=2q^3-rq^2-2q+1$ 为了 $3 le r le (q+1)/2$, $q ge 5$; $d=2q^3-3q^2-3q+1$ 为了 $q ge 9$; $d=2q^3-4q^2-3q+1$ 为了 $q ge 9$;和 $d=q^3-q^2-rq-2$ 有 $r=4, 5$ 或 $6$ 为了 $q ge 9$,其中 $g_q(4,d)=sum_{i=0}^{3} leftlceil d/q^i rightrceil$。结果是 $n_q(4,d) = g_q(4,d)+1$ 为了 $2q^3-3q^2-3q+1 le d le 2q^3-3q^2$, $2q^3-5q^2-2q+1 le d le 2q^3-5q^2$ 和 $q^3-q^2-rq-2 le d le q^3-q^2-rq$ 有 $4 le r le 6$ 为了 $q ge 9$ 这就是 $n_q(4,d) ge g_q(4,d)+1$ 为了 $2q^3-rq^2-2q+1 le d le 2q^3-rq^2-q$ 为了 $3 le r le (q+1)/2$, $q ge 5$ 和 $2q^3-4q^2-3q+1 le d le 2q^3-4q^2-2q$ 为了 $q ge 9$,其中 $n_q(4,d)$ 表示最小长度。 $n$ 为了什么? $[n,4,d]_q$ 代码存在。
{"title":"Non-existence of some 4-dimensional Griesmer codes over finite fields","authors":"Kazuki Kumegawa, T. Maruta","doi":"10.13069/jacodesmath.427968","DOIUrl":"https://doi.org/10.13069/jacodesmath.427968","url":null,"abstract":"We prove the non--existence of $[g_q(4,d),4,d]_q$ codes for $d=2q^3-rq^2-2q+1$ for $3 le r le (q+1)/2$, $q ge 5$; $d=2q^3-3q^2-3q+1$ for $q ge 9$; $d=2q^3-4q^2-3q+1$ for $q ge 9$; and $d=q^3-q^2-rq-2$ with $r=4, 5$ or $6$ for $q ge 9$, where $g_q(4,d)=sum_{i=0}^{3} leftlceil d/q^i rightrceil$. This yields that $n_q(4,d) = g_q(4,d)+1$ for $2q^3-3q^2-3q+1 le d le 2q^3-3q^2$, $2q^3-5q^2-2q+1 le d le 2q^3-5q^2$ and $q^3-q^2-rq-2 le d le q^3-q^2-rq$ with $4 le r le 6$ for $q ge 9$ and that $n_q(4,d) ge g_q(4,d)+1$ for $2q^3-rq^2-2q+1 le d le 2q^3-rq^2-q$ for $3 le r le (q+1)/2$, $q ge 5$ and $2q^3-4q^2-3q+1 le d le 2q^3-4q^2-2q$ for $q ge 9$, where $n_q(4,d)$ denotes the minimum length $n$ for which an $[n,4,d]_q$ code exists.","PeriodicalId":37029,"journal":{"name":"Journal of Algebra Combinatorics Discrete Structures and Applications","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47232360","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
$mathbb{Z}_{q}(mathbb{Z}_{q}+umathbb{Z}_{q})-$ linear skew constacyclic codes $mathbb{Z}_{q} (mathbb{Z}_{q} +umathbb{Z}_{q} )-$线性斜恒循环码
Q3 Mathematics Pub Date : 2018-03-25 DOI: 10.13069/jacodesmath.671815
A. Melakhessou, N. Aydin, K. Guenda
In this paper, we study skew constacyclic codes over the ring $mathbb{Z}_{q}R$ where $R=mathbb{Z}_{q}+umathbb{Z}_{q}$, $q=p^{s}$ for a prime $p$ and $u^{2}=0$. We give the definition of these codes as subsets of the ring $mathbb{Z}_{q}^{alpha}R^{beta}$. Some structural properties of the skew polynomial ring $ R[x,theta]$ are discussed, where $ theta$ is an automorphism of $R$. We describe the generator polynomials of skew constacyclic codes over $ R $ and $mathbb{Z}_{q}R$. Using Gray images of skew constacyclic codes over $mathbb{Z}_{q}R$ we obtained some new linear codes over $mathbb{Z}_4$. Further, we have generalized these codes to double skew constacyclic codes over $mathbb{Z}_{q}R$.
本文研究了环$mathbb{Z}_{q}R$上的偏常环码,其中$R=mathbb{Z}_{q}+umathbb{Z}_{q}$, $q=p^{s}$为素数$p$和$u^{2}=0$。我们给出了这些码作为环$mathbb{Z}_{q}^{alpha}R^{beta}$子集的定义。讨论了歪多项式环$ R[x,theta]$的一些结构性质,其中$ theta$是$R$的自同构。我们描述了$ R $和$mathbb{Z}_{q}R$上的偏常环码的生成器多项式。利用$mathbb{Z}_{q}R$上偏常环码的灰度图像,得到了$mathbb{Z}_4$上新的线性码。进一步,我们将这些码推广到$mathbb{Z}_{q}R$上的双斜常环码。
{"title":"$mathbb{Z}_{q}(mathbb{Z}_{q}+umathbb{Z}_{q})-$ linear skew constacyclic codes","authors":"A. Melakhessou, N. Aydin, K. Guenda","doi":"10.13069/jacodesmath.671815","DOIUrl":"https://doi.org/10.13069/jacodesmath.671815","url":null,"abstract":"In this paper, we study skew constacyclic codes over the ring $mathbb{Z}_{q}R$ where $R=mathbb{Z}_{q}+umathbb{Z}_{q}$, $q=p^{s}$ for a prime $p$ and $u^{2}=0$. We give the definition of these codes as subsets of the ring $mathbb{Z}_{q}^{alpha}R^{beta}$. Some structural properties of the skew polynomial ring $ R[x,theta]$ are discussed, where $ theta$ is an automorphism of $R$. We describe the generator polynomials of skew constacyclic codes over $ R $ and $mathbb{Z}_{q}R$. Using Gray images of skew constacyclic codes over $mathbb{Z}_{q}R$ we obtained some new linear codes over $mathbb{Z}_4$. Further, we have generalized these codes to double skew constacyclic codes over $mathbb{Z}_{q}R$.","PeriodicalId":37029,"journal":{"name":"Journal of Algebra Combinatorics Discrete Structures and Applications","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47575885","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
One–generator quasi–abelian codes revisited 重新审视单生成器拟阿贝尔码
Q3 Mathematics Pub Date : 2016-02-07 DOI: 10.13069/jacodesmath.09585
Somphong Jitman, P. Udomkavanich
The class of 1-generator quasi-abelian codes over finite fields is revisited. Alternative and explicit characterization and enumeration of such codes are given. An algorithm to find all 1-generator quasi-abelian codes is provided. Two 1-generator quasi-abelian codes whose minimum distances are improved from Grassl’s online table are presented.
重新讨论了有限域上的一类1-生成拟阿贝尔码。给出了这种代码的可选和明确的表征和枚举。给出了一种求出所有1-生成器拟阿贝尔码的算法。给出了两个1-生成器拟阿贝尔码,它们的最小距离是对Grassl在线表的改进。
{"title":"One–generator quasi–abelian codes revisited","authors":"Somphong Jitman, P. Udomkavanich","doi":"10.13069/jacodesmath.09585","DOIUrl":"https://doi.org/10.13069/jacodesmath.09585","url":null,"abstract":"The class of 1-generator quasi-abelian codes over finite fields is revisited. Alternative and explicit characterization and enumeration of such codes are given. An algorithm to find all 1-generator quasi-abelian codes is provided. Two 1-generator quasi-abelian codes whose minimum distances are improved from Grassl’s online table are presented.","PeriodicalId":37029,"journal":{"name":"Journal of Algebra Combinatorics Discrete Structures and Applications","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66233241","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Self-dual and complementary dual abelian codes over Galois rings 伽罗瓦环上的自对偶和互补对偶阿贝尔码
Q3 Mathematics Pub Date : 2014-06-15 DOI: 10.13069/JACODESMATH.560406
Somphong Jitman, S. Ling
Self-dual and complementary dual cyclic/abelian codes over finite fields form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, abelian codes over Galois rings are studied in terms of the ideals in the group ring ${ GR}(p^r,s)[G]$, where $G$ is a finite abelian group and ${ GR}(p^r,s)$ is a Galois ring. Characterizations of self-dual abelian codes have been given together with necessary and sufficient conditions for the existence of a self-dual abelian code in ${ GR}(p^r,s)[G]$. A general formula for the number of such self-dual codes is established. In the case where $gcd(|G|,p)=1$, the number of self-dual abelian codes in ${ GR}(p^r,s)[G]$ is completely and explicitly determined. Applying known results on cyclic codes of length $p^a$ over ${ GR}(p^2,s)$, an explicit formula for the number of self-dual abelian codes in ${ GR}(p^2,s)[G]$ are given, where the Sylow $p$-subgroup of $G$ is cyclic. Subsequently, the characterization and enumeration of complementary dual abelian codes in ${ GR}(p^r,s)[G]$ are established. The analogous results for self-dual and complementary dual cyclic codes over Galois rings are therefore obtained as corollaries.
有限域上的自对偶和互补对偶循环/阿贝尔码是一类重要的线性码,由于其丰富的代数结构和广泛的应用而得到了广泛的研究。本文根据群环${GR}(p^r,s)[G]$中的理想研究了伽罗瓦环上的阿贝尔码,其中$G$是有限阿贝尔群,${GR}(p^r,s)$是伽罗瓦环。给出了${GR}(p^r,s)[G]$中自对偶阿贝尔码存在的充分必要条件。建立了这种自对偶码数的一般公式。在$gcd(|G|,p)=1$的情况下,${GR}(p^r,s)[G]$中的自对偶阿贝尔码的个数是完全显式确定的。应用已知长度为$p^a$的循环码在${GR}(p^2,s)$上的结果,给出了${GR}(p^2,s)[G]$中自对偶阿贝尔码个数的显式公式,其中$G$的Sylow $p$-子群是循环的。随后,建立了${GR}(p^r,s)[G]$中互补对偶阿贝尔码的刻画和枚举。由此得到了伽罗瓦环上自对偶和互补对偶循环码的类似结果作为推论。
{"title":"Self-dual and complementary dual abelian codes over Galois rings","authors":"Somphong Jitman, S. Ling","doi":"10.13069/JACODESMATH.560406","DOIUrl":"https://doi.org/10.13069/JACODESMATH.560406","url":null,"abstract":"Self-dual and complementary dual cyclic/abelian codes over finite fields form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, abelian codes over Galois rings are studied in terms of the ideals in the group ring ${ GR}(p^r,s)[G]$, where $G$ is a finite abelian group and ${ GR}(p^r,s)$ is a Galois ring. Characterizations of self-dual abelian codes have been given together with necessary and sufficient conditions for the existence of a self-dual abelian code in ${ GR}(p^r,s)[G]$. A general formula for the number of such self-dual codes is established. In the case where $gcd(|G|,p)=1$, the number of self-dual abelian codes in ${ GR}(p^r,s)[G]$ is completely and explicitly determined. Applying known results on cyclic codes of length $p^a$ over ${ GR}(p^2,s)$, an explicit formula for the number of self-dual abelian codes in ${ GR}(p^2,s)[G]$ are given, where the Sylow $p$-subgroup of $G$ is cyclic. Subsequently, the characterization and enumeration of complementary dual abelian codes in ${ GR}(p^r,s)[G]$ are established. The analogous results for self-dual and complementary dual cyclic codes over Galois rings are therefore obtained as corollaries.","PeriodicalId":37029,"journal":{"name":"Journal of Algebra Combinatorics Discrete Structures and Applications","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66232853","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Journal of Algebra Combinatorics Discrete Structures and Applications
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1