{"title":"多扭曲码伽罗瓦壳的生成多项式矩阵","authors":"Ramy Taki Eldin , Patrick Solé","doi":"10.1016/j.ffa.2025.102712","DOIUrl":null,"url":null,"abstract":"<div><div>In this study, we consider the Euclidean and Galois hulls of multi-twisted (MT) codes over a finite field <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mi>p</mi></mrow><mrow><mi>e</mi></mrow></msup></mrow></msub></math></span> of characteristic <em>p</em>. Let <strong>G</strong> be a generator polynomial matrix (GPM) of an MT code <span><math><mi>C</mi></math></span>. For any <span><math><mn>0</mn><mo>≤</mo><mi>κ</mi><mo><</mo><mi>e</mi></math></span>, the <em>κ</em>-Galois hull of <span><math><mi>C</mi></math></span>, denoted by <span><math><msub><mrow><mi>h</mi></mrow><mrow><mi>κ</mi></mrow></msub><mrow><mo>(</mo><mi>C</mi><mo>)</mo></mrow></math></span>, is the intersection of <span><math><mi>C</mi></math></span> with its <em>κ</em>-Galois dual. The main result in this paper is that a GPM for <span><math><msub><mrow><mi>h</mi></mrow><mrow><mi>κ</mi></mrow></msub><mrow><mo>(</mo><mi>C</mi><mo>)</mo></mrow></math></span> has been obtained from <strong>G</strong>. We start by associating a linear code <span><math><msub><mrow><mi>Q</mi></mrow><mrow><mi>G</mi></mrow></msub></math></span> with <strong>G</strong>. We show that <span><math><msub><mrow><mi>Q</mi></mrow><mrow><mi>G</mi></mrow></msub></math></span> is quasi-cyclic. In addition, we prove that the dimension of <span><math><msub><mrow><mi>h</mi></mrow><mrow><mi>κ</mi></mrow></msub><mrow><mo>(</mo><mi>C</mi><mo>)</mo></mrow></math></span> is the difference between the dimension of <span><math><mi>C</mi></math></span> and that of <span><math><msub><mrow><mi>Q</mi></mrow><mrow><mi>G</mi></mrow></msub></math></span>. Thus the determinantal divisors are used to derive a formula for the dimension of <span><math><msub><mrow><mi>h</mi></mrow><mrow><mi>κ</mi></mrow></msub><mrow><mo>(</mo><mi>C</mi><mo>)</mo></mrow></math></span>. Finally, we deduce a GPM formula for <span><math><msub><mrow><mi>h</mi></mrow><mrow><mi>κ</mi></mrow></msub><mrow><mo>(</mo><mi>C</mi><mo>)</mo></mrow></math></span>. In particular, we handle the cases of <em>κ</em>-Galois self-orthogonal and linear complementary dual MT codes; we establish equivalent conditions that characterize these cases. Equivalent results can be deduced immediately for the classes of cyclic, constacyclic, quasi-cyclic, generalized quasi-cyclic, and quasi-twisted codes, because they are all special cases of MT codes. Some numerical examples, containing codes with the best-known parameters, are used to illustrate the theoretical results.</div></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"109 ","pages":"Article 102712"},"PeriodicalIF":1.2000,"publicationDate":"2025-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Generator polynomial matrices of the Galois hulls of multi-twisted codes\",\"authors\":\"Ramy Taki Eldin , Patrick Solé\",\"doi\":\"10.1016/j.ffa.2025.102712\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In this study, we consider the Euclidean and Galois hulls of multi-twisted (MT) codes over a finite field <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mi>p</mi></mrow><mrow><mi>e</mi></mrow></msup></mrow></msub></math></span> of characteristic <em>p</em>. Let <strong>G</strong> be a generator polynomial matrix (GPM) of an MT code <span><math><mi>C</mi></math></span>. For any <span><math><mn>0</mn><mo>≤</mo><mi>κ</mi><mo><</mo><mi>e</mi></math></span>, the <em>κ</em>-Galois hull of <span><math><mi>C</mi></math></span>, denoted by <span><math><msub><mrow><mi>h</mi></mrow><mrow><mi>κ</mi></mrow></msub><mrow><mo>(</mo><mi>C</mi><mo>)</mo></mrow></math></span>, is the intersection of <span><math><mi>C</mi></math></span> with its <em>κ</em>-Galois dual. The main result in this paper is that a GPM for <span><math><msub><mrow><mi>h</mi></mrow><mrow><mi>κ</mi></mrow></msub><mrow><mo>(</mo><mi>C</mi><mo>)</mo></mrow></math></span> has been obtained from <strong>G</strong>. We start by associating a linear code <span><math><msub><mrow><mi>Q</mi></mrow><mrow><mi>G</mi></mrow></msub></math></span> with <strong>G</strong>. We show that <span><math><msub><mrow><mi>Q</mi></mrow><mrow><mi>G</mi></mrow></msub></math></span> is quasi-cyclic. In addition, we prove that the dimension of <span><math><msub><mrow><mi>h</mi></mrow><mrow><mi>κ</mi></mrow></msub><mrow><mo>(</mo><mi>C</mi><mo>)</mo></mrow></math></span> is the difference between the dimension of <span><math><mi>C</mi></math></span> and that of <span><math><msub><mrow><mi>Q</mi></mrow><mrow><mi>G</mi></mrow></msub></math></span>. Thus the determinantal divisors are used to derive a formula for the dimension of <span><math><msub><mrow><mi>h</mi></mrow><mrow><mi>κ</mi></mrow></msub><mrow><mo>(</mo><mi>C</mi><mo>)</mo></mrow></math></span>. Finally, we deduce a GPM formula for <span><math><msub><mrow><mi>h</mi></mrow><mrow><mi>κ</mi></mrow></msub><mrow><mo>(</mo><mi>C</mi><mo>)</mo></mrow></math></span>. In particular, we handle the cases of <em>κ</em>-Galois self-orthogonal and linear complementary dual MT codes; we establish equivalent conditions that characterize these cases. Equivalent results can be deduced immediately for the classes of cyclic, constacyclic, quasi-cyclic, generalized quasi-cyclic, and quasi-twisted codes, because they are all special cases of MT codes. Some numerical examples, containing codes with the best-known parameters, are used to illustrate the theoretical results.</div></div>\",\"PeriodicalId\":50446,\"journal\":{\"name\":\"Finite Fields and Their Applications\",\"volume\":\"109 \",\"pages\":\"Article 102712\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2025-08-04\",\"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/S107157972500142X\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Finite Fields and Their Applications","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S107157972500142X","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
Generator polynomial matrices of the Galois hulls of multi-twisted codes
In this study, we consider the Euclidean and Galois hulls of multi-twisted (MT) codes over a finite field of characteristic p. Let G be a generator polynomial matrix (GPM) of an MT code . For any , the κ-Galois hull of , denoted by , is the intersection of with its κ-Galois dual. The main result in this paper is that a GPM for has been obtained from G. We start by associating a linear code with G. We show that is quasi-cyclic. In addition, we prove that the dimension of is the difference between the dimension of and that of . Thus the determinantal divisors are used to derive a formula for the dimension of . Finally, we deduce a GPM formula for . In particular, we handle the cases of κ-Galois self-orthogonal and linear complementary dual MT codes; we establish equivalent conditions that characterize these cases. Equivalent results can be deduced immediately for the classes of cyclic, constacyclic, quasi-cyclic, generalized quasi-cyclic, and quasi-twisted codes, because they are all special cases of MT codes. Some numerical examples, containing codes with the best-known parameters, are used to illustrate the theoretical results.
期刊介绍:
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.