{"title":"厄米和铃木函数域的非线性复杂性","authors":"Ferruh Özbudak, Nesrin Tutaş","doi":"10.1007/s00200-023-00629-z","DOIUrl":null,"url":null,"abstract":"<div><p>The notion of <span>\\(k-\\)</span>th order nonlinear complexity has been studied from various aspects. Geil, Özbudak and Ruano (Semigroup Forum 98:543–555, 2019) gave a construction of a sequence of length <span>\\((q-1)(q^{2}-1)\\)</span> with high nonlinear complexity by using the Weierstrass semigroup of two distinct rational points on a Hermitian function field over <span>\\(F_{q^{2}}\\)</span>, and they improved the bounds on the <span>\\(k-\\)</span>th order nonlinear complexity <span>\\(N^{k}(s)\\)</span> and <span>\\(L^{k}(s)\\)</span> obtained by Niederreiter and Xing (IEEE Trans Inf Theory 60(10):6696–6701, 2014), where <span>\\(F_{q^2}\\)</span> is the finite field with <span>\\(q^2\\)</span> elements, and <i>q</i> is a prime power. In this work, we exhibit the lower bounds on <span>\\(N^{k}(s)\\)</span> and <span>\\(L^{k}(s)\\)</span> on a Hermitian function field using Hermitian triangles over <span>\\(F_{q^2}.\\)</span> We study the effect of a Hermitian triangle by its type. The possible cases on the <i>k</i>-th order nonlinear complexity are explained, for each type, and we improve the lower bounds obtained by Geil et al. We construct two different sequences with the help of the Weierstrass semigroup of <i>l</i> distinct collinear rational points, and we compare our results of the lower bounds on <span>\\(N^{k}(s)\\)</span> and <span>\\(L^{k}(s).\\)</span> Also, we study the lower bounds on <span>\\(N^{k}(s)\\)</span> and <span>\\(L^{k}(s)\\)</span> using the Weierstrass semigroup of two distinct rational points on a Suzuki function field over <span>\\(F_{q},\\)</span> where <span>\\(q={2q_{0}}^{2}, q_{0}=2^{t}, t\\ge 1.\\)</span></p></div>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":"36 4","pages":"631 - 657"},"PeriodicalIF":0.6000,"publicationDate":"2023-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Nonlinear complexity from the Hermitian and the Suzuki function fields\",\"authors\":\"Ferruh Özbudak, Nesrin Tutaş\",\"doi\":\"10.1007/s00200-023-00629-z\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The notion of <span>\\\\(k-\\\\)</span>th order nonlinear complexity has been studied from various aspects. Geil, Özbudak and Ruano (Semigroup Forum 98:543–555, 2019) gave a construction of a sequence of length <span>\\\\((q-1)(q^{2}-1)\\\\)</span> with high nonlinear complexity by using the Weierstrass semigroup of two distinct rational points on a Hermitian function field over <span>\\\\(F_{q^{2}}\\\\)</span>, and they improved the bounds on the <span>\\\\(k-\\\\)</span>th order nonlinear complexity <span>\\\\(N^{k}(s)\\\\)</span> and <span>\\\\(L^{k}(s)\\\\)</span> obtained by Niederreiter and Xing (IEEE Trans Inf Theory 60(10):6696–6701, 2014), where <span>\\\\(F_{q^2}\\\\)</span> is the finite field with <span>\\\\(q^2\\\\)</span> elements, and <i>q</i> is a prime power. In this work, we exhibit the lower bounds on <span>\\\\(N^{k}(s)\\\\)</span> and <span>\\\\(L^{k}(s)\\\\)</span> on a Hermitian function field using Hermitian triangles over <span>\\\\(F_{q^2}.\\\\)</span> We study the effect of a Hermitian triangle by its type. The possible cases on the <i>k</i>-th order nonlinear complexity are explained, for each type, and we improve the lower bounds obtained by Geil et al. We construct two different sequences with the help of the Weierstrass semigroup of <i>l</i> distinct collinear rational points, and we compare our results of the lower bounds on <span>\\\\(N^{k}(s)\\\\)</span> and <span>\\\\(L^{k}(s).\\\\)</span> Also, we study the lower bounds on <span>\\\\(N^{k}(s)\\\\)</span> and <span>\\\\(L^{k}(s)\\\\)</span> using the Weierstrass semigroup of two distinct rational points on a Suzuki function field over <span>\\\\(F_{q},\\\\)</span> where <span>\\\\(q={2q_{0}}^{2}, q_{0}=2^{t}, t\\\\ge 1.\\\\)</span></p></div>\",\"PeriodicalId\":50742,\"journal\":{\"name\":\"Applicable Algebra in Engineering Communication and Computing\",\"volume\":\"36 4\",\"pages\":\"631 - 657\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-10-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applicable Algebra in Engineering Communication and Computing\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00200-023-00629-z\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applicable Algebra in Engineering Communication and Computing","FirstCategoryId":"5","ListUrlMain":"https://link.springer.com/article/10.1007/s00200-023-00629-z","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
摘要
\(k-\)阶非线性复杂度的概念已经从多个方面进行了研究。Geil, Özbudak和Ruano (Semigroup Forum 98:543-555, 2019)利用\(F_{q^{2}}\)上的hermite函数场上两个不同有理性点的Weierstrass半群构造了一个长度为\((q-1)(q^{2}-1)\)的高非线性复杂度序列,并改进了Niederreiter和Xing (IEEE Trans Inf Theory 60(10): 6696-6701, 2014)的\(k-\)阶非线性复杂度的界\(N^{k}(s)\)和\(L^{k}(s)\)。其中\(F_{q^2}\)是包含\(q^2\)个单元的有限域,q是素数幂。在这项工作中,我们利用\(F_{q^2}.\)上的厄米三角形展示了厄米函数场\(N^{k}(s)\)和\(L^{k}(s)\)的下界,并研究了厄米三角形的类型对其的影响。解释了每种类型的k阶非线性复杂性的可能情况,并改进了Geil等人得到的下界。我们利用l个不同的共线有理点的Weierstrass半群构造了两个不同的序列,并比较了\(N^{k}(s)\)和\(L^{k}(s).\)上的下界结果。同时,我们利用\(F_{q},\)上铃木函数域上两个不同的有理点的Weierstrass半群研究了\(N^{k}(s)\)和\(L^{k}(s)\)上的下界 \(q={2q_{0}}^{2}, q_{0}=2^{t}, t\ge 1.\)
Nonlinear complexity from the Hermitian and the Suzuki function fields
The notion of \(k-\)th order nonlinear complexity has been studied from various aspects. Geil, Özbudak and Ruano (Semigroup Forum 98:543–555, 2019) gave a construction of a sequence of length \((q-1)(q^{2}-1)\) with high nonlinear complexity by using the Weierstrass semigroup of two distinct rational points on a Hermitian function field over \(F_{q^{2}}\), and they improved the bounds on the \(k-\)th order nonlinear complexity \(N^{k}(s)\) and \(L^{k}(s)\) obtained by Niederreiter and Xing (IEEE Trans Inf Theory 60(10):6696–6701, 2014), where \(F_{q^2}\) is the finite field with \(q^2\) elements, and q is a prime power. In this work, we exhibit the lower bounds on \(N^{k}(s)\) and \(L^{k}(s)\) on a Hermitian function field using Hermitian triangles over \(F_{q^2}.\) We study the effect of a Hermitian triangle by its type. The possible cases on the k-th order nonlinear complexity are explained, for each type, and we improve the lower bounds obtained by Geil et al. We construct two different sequences with the help of the Weierstrass semigroup of l distinct collinear rational points, and we compare our results of the lower bounds on \(N^{k}(s)\) and \(L^{k}(s).\) Also, we study the lower bounds on \(N^{k}(s)\) and \(L^{k}(s)\) using the Weierstrass semigroup of two distinct rational points on a Suzuki function field over \(F_{q},\) where \(q={2q_{0}}^{2}, q_{0}=2^{t}, t\ge 1.\)
期刊介绍:
Algebra is a common language for many scientific domains. In developing this language mathematicians prove theorems and design methods which demonstrate the applicability of algebra. Using this language scientists in many fields find algebra indispensable to create methods, techniques and tools to solve their specific problems.
Applicable Algebra in Engineering, Communication and Computing will publish mathematically rigorous, original research papers reporting on algebraic methods and techniques relevant to all domains concerned with computers, intelligent systems and communications. Its scope includes, but is not limited to, vision, robotics, system design, fault tolerance and dependability of systems, VLSI technology, signal processing, signal theory, coding, error control techniques, cryptography, protocol specification, networks, software engineering, arithmetics, algorithms, complexity, computer algebra, programming languages, logic and functional programming, algebraic specification, term rewriting systems, theorem proving, graphics, modeling, knowledge engineering, expert systems, and artificial intelligence methodology.
Purely theoretical papers will not primarily be sought, but papers dealing with problems in such domains as commutative or non-commutative algebra, group theory, field theory, or real algebraic geometry, which are of interest for applications in the above mentioned fields are relevant for this journal.
On the practical side, technology and know-how transfer papers from engineering which either stimulate or illustrate research in applicable algebra are within the scope of the journal.