{"title":"关于长度为 $$(q^m+1)/\\lambda $$ 的 $$\\mathbb {F}_q$$ 上一些 LCD BCH 编码的参数","authors":"","doi":"10.1007/s12095-024-00697-z","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> <p>As a particular subclass of cyclic codes, BCH codes have wide applications in storage devices, communication systems, consumer electronics and other fields. However, parameters of BCH codes are unknown in general. In this paper, we investigate parameters of BCH codes of length <span> <span>\\(\\frac{q^m+1}{\\lambda }\\)</span> </span> where <span> <span>\\(\\lambda \\mid q+1\\)</span> </span>.Some new techniques are employed to study the coset leaders. For any odd prime power <em>q</em> and <span> <span>\\(m=4,8\\)</span> </span>, or <span> <span>\\(m\\ge 12\\)</span> </span> and <span> <span>\\(m\\equiv 4~ (\\textrm{mod}~ 8)\\)</span> </span>, the second, the third and the fourth largest coset leaders modulo <span> <span>\\(q^m+1\\)</span> </span> are determined, and the dimensions of some BCH codes of length <span> <span>\\(q^m+1\\)</span> </span> with large designed distances are given. For <span> <span>\\(1<\\lambda <q+1\\)</span> </span>, the first few largest coset leaders and the coset leaders modulo <span> <span>\\(\\frac{q^m+1}{\\lambda }\\)</span> </span> in the range 1 to <span> <span>\\( \\frac{ q^{\\lfloor (m+1)/2\\rfloor }}{\\lambda }\\)</span> </span> are studied, and the dimensions of some BCH codes of length <span> <span>\\(\\frac{q^m+1}{\\lambda }\\)</span> </span> are given as well. The BCH codes presented in this paper are LCD codes and have a sharper lower bound on the minimum distance than the well-known BCH bound.</p>","PeriodicalId":10788,"journal":{"name":"Cryptography and Communications","volume":"32 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the parameters of some LCD BCH codes over $$\\\\mathbb {F}_q$$ with length $$(q^m+1)/\\\\lambda $$\",\"authors\":\"\",\"doi\":\"10.1007/s12095-024-00697-z\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<h3>Abstract</h3> <p>As a particular subclass of cyclic codes, BCH codes have wide applications in storage devices, communication systems, consumer electronics and other fields. However, parameters of BCH codes are unknown in general. In this paper, we investigate parameters of BCH codes of length <span> <span>\\\\(\\\\frac{q^m+1}{\\\\lambda }\\\\)</span> </span> where <span> <span>\\\\(\\\\lambda \\\\mid q+1\\\\)</span> </span>.Some new techniques are employed to study the coset leaders. For any odd prime power <em>q</em> and <span> <span>\\\\(m=4,8\\\\)</span> </span>, or <span> <span>\\\\(m\\\\ge 12\\\\)</span> </span> and <span> <span>\\\\(m\\\\equiv 4~ (\\\\textrm{mod}~ 8)\\\\)</span> </span>, the second, the third and the fourth largest coset leaders modulo <span> <span>\\\\(q^m+1\\\\)</span> </span> are determined, and the dimensions of some BCH codes of length <span> <span>\\\\(q^m+1\\\\)</span> </span> with large designed distances are given. For <span> <span>\\\\(1<\\\\lambda <q+1\\\\)</span> </span>, the first few largest coset leaders and the coset leaders modulo <span> <span>\\\\(\\\\frac{q^m+1}{\\\\lambda }\\\\)</span> </span> in the range 1 to <span> <span>\\\\( \\\\frac{ q^{\\\\lfloor (m+1)/2\\\\rfloor }}{\\\\lambda }\\\\)</span> </span> are studied, and the dimensions of some BCH codes of length <span> <span>\\\\(\\\\frac{q^m+1}{\\\\lambda }\\\\)</span> </span> are given as well. The BCH codes presented in this paper are LCD codes and have a sharper lower bound on the minimum distance than the well-known BCH bound.</p>\",\"PeriodicalId\":10788,\"journal\":{\"name\":\"Cryptography and Communications\",\"volume\":\"32 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-01-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Cryptography and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s12095-024-00697-z\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cryptography and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s12095-024-00697-z","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the parameters of some LCD BCH codes over $$\mathbb {F}_q$$ with length $$(q^m+1)/\lambda $$
Abstract
As a particular subclass of cyclic codes, BCH codes have wide applications in storage devices, communication systems, consumer electronics and other fields. However, parameters of BCH codes are unknown in general. In this paper, we investigate parameters of BCH codes of length \(\frac{q^m+1}{\lambda }\) where \(\lambda \mid q+1\).Some new techniques are employed to study the coset leaders. For any odd prime power q and \(m=4,8\), or \(m\ge 12\) and \(m\equiv 4~ (\textrm{mod}~ 8)\), the second, the third and the fourth largest coset leaders modulo \(q^m+1\) are determined, and the dimensions of some BCH codes of length \(q^m+1\) with large designed distances are given. For \(1<\lambda <q+1\), the first few largest coset leaders and the coset leaders modulo \(\frac{q^m+1}{\lambda }\) in the range 1 to \( \frac{ q^{\lfloor (m+1)/2\rfloor }}{\lambda }\) are studied, and the dimensions of some BCH codes of length \(\frac{q^m+1}{\lambda }\) are given as well. The BCH codes presented in this paper are LCD codes and have a sharper lower bound on the minimum distance than the well-known BCH bound.