{"title":"On two conjectures of the duals of AMDS BCH codes","authors":"Haode Yan","doi":"10.1016/j.ffa.2025.102765","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper, we study the duals of BCH codes <span><math><msub><mrow><mi>C</mi></mrow><mrow><mo>(</mo><mi>q</mi><mo>,</mo><mi>q</mi><mo>+</mo><mn>1</mn><mo>,</mo><mn>3</mn><mo>,</mo><mfrac><mrow><mi>p</mi><mo>−</mo><mn>1</mn></mrow><mrow><mn>2</mn></mrow></mfrac><mo>)</mo></mrow></msub></math></span> and <span><math><msub><mrow><mi>C</mi></mrow><mrow><mo>(</mo><msup><mrow><mn>3</mn></mrow><mrow><mi>s</mi></mrow></msup><mo>,</mo><msup><mrow><mn>3</mn></mrow><mrow><mi>s</mi></mrow></msup><mo>+</mo><mn>1</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>)</mo></mrow></msub></math></span>. By analyzing the number of solutions to certain equations over the multiplicative subgroup <span><math><msub><mrow><mi>U</mi></mrow><mrow><mi>q</mi><mo>+</mo><mn>1</mn></mrow></msub><mo>=</mo><mo>{</mo><mi>x</mi><mo>∈</mo><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mi>q</mi></mrow><mrow><mn>2</mn></mrow></msup></mrow></msub><mo>:</mo><msup><mrow><mi>x</mi></mrow><mrow><mi>q</mi><mo>+</mo><mn>1</mn></mrow></msup><mo>=</mo><mn>1</mn><mo>}</mo></math></span> of <span><math><msubsup><mrow><mi>F</mi></mrow><mrow><msup><mrow><mi>q</mi></mrow><mrow><mn>2</mn></mrow></msup></mrow><mrow><mo>⁎</mo></mrow></msubsup></math></span>, we determine the possible weights of codewords in <span><math><msubsup><mrow><mi>C</mi></mrow><mrow><mo>(</mo><mi>q</mi><mo>,</mo><mi>q</mi><mo>+</mo><mn>1</mn><mo>,</mo><mn>3</mn><mo>,</mo><mfrac><mrow><mi>p</mi><mo>−</mo><mn>1</mn></mrow><mrow><mn>2</mn></mrow></mfrac><mo>)</mo></mrow><mrow><mo>⊥</mo></mrow></msubsup></math></span> and <span><math><msubsup><mrow><mi>C</mi></mrow><mrow><mo>(</mo><msup><mrow><mn>3</mn></mrow><mrow><mi>s</mi></mrow></msup><mo>,</mo><msup><mrow><mn>3</mn></mrow><mrow><mi>s</mi></mrow></msup><mo>+</mo><mn>1</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn><mo>)</mo></mrow><mrow><mo>⊥</mo></mrow></msubsup></math></span>, respectively. The weight distributions of these two dual codes are derived by applying the Pless power moments. Our results provide affirmative solutions to recent conjectures.</div></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"111 ","pages":"Article 102765"},"PeriodicalIF":1.3000,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Finite Fields and Their Applications","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1071579725001959","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/12/1 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we study the duals of BCH codes and . By analyzing the number of solutions to certain equations over the multiplicative subgroup of , we determine the possible weights of codewords in and , respectively. The weight distributions of these two dual codes are derived by applying the Pless power moments. Our results provide affirmative solutions to recent conjectures.
期刊介绍:
Finite Fields and Their Applications is a peer-reviewed technical journal publishing papers in finite field theory as well as in applications of finite fields. As a result of applications in a wide variety of areas, finite fields are increasingly important in several areas of mathematics, including linear and abstract algebra, number theory and algebraic geometry, as well as in computer science, statistics, information theory, and engineering.
For cohesion, and because so many applications rely on various theoretical properties of finite fields, it is essential that there be a core of high-quality papers on theoretical aspects. In addition, since much of the vitality of the area comes from computational problems, the journal publishes papers on computational aspects of finite fields as well as on algorithms and complexity of finite field-related methods.
The journal also publishes papers in various applications including, but not limited to, algebraic coding theory, cryptology, combinatorial design theory, pseudorandom number generation, and linear recurring sequences. There are other areas of application to be included, but the important point is that finite fields play a nontrivial role in the theory, application, or algorithm.