Kris Coolsaet,Silvia M. C. Pagani,Arne Botteldoorn
{"title":"The odd and even sets of $$textrm{PG}(2,8)$$, up to equivalence","authors":"Kris Coolsaet,Silvia M. C. Pagani,Arne Botteldoorn","doi":"10.1007/s10623-026-01918-7","DOIUrl":"https://doi.org/10.1007/s10623-026-01918-7","url":null,"abstract":"","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"30 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148894499","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Generalized quadrangles with a point-primitive and line-primitive automorphism group with socle $$textrm{PSp}_4(q)$$","authors":"Meizi Ou, Jianbing Lu","doi":"10.1007/s10623-026-01923-w","DOIUrl":"https://doi.org/10.1007/s10623-026-01923-w","url":null,"abstract":"","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"5 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148883451","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Regular fat linear sets","authors":"Valentino Smaldore,Corrado Zanella,Ferdinando Zullo","doi":"10.1007/s10623-026-01926-7","DOIUrl":"https://doi.org/10.1007/s10623-026-01926-7","url":null,"abstract":"Abstract In this work, we introduce ( r , i )-regular fat linear sets, which are defined as linear sets containing exactly r points of weight i and all other points of weight one. This notion generalizes and unifies existing constructions; scattered linear sets, clubs, and other previously studied families are special cases. We present new classes of regular fat linear sets in $${{,textrm{PG},}}(k-1,q^n)$$ PG ( k - 1 , q n ) for composite n and study their equivalence classes. Finally, we show that regular fat linear sets naturally yield three-weight rank-metric codes, which we use to obtain bounds on their parameters.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"8 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148894500","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xingwei Ren,Yang Zhou,Yongqiang Li,Ya Han,Lin Jiao,Mingsheng Wang
{"title":"Low-data cryptanalysis of LowMC instances with full S-box layers","authors":"Xingwei Ren,Yang Zhou,Yongqiang Li,Ya Han,Lin Jiao,Mingsheng Wang","doi":"10.1007/s10623-026-01940-9","DOIUrl":"https://doi.org/10.1007/s10623-026-01940-9","url":null,"abstract":"","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"27 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148933931","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Using cyclic $$(f,sigma )$$-codes over finite chain rings to construct $$mathbb {Z}_p$$- and $$mathbb {F}_q[![t]!]$$-lattices","authors":"S. Pumplün","doi":"10.1007/s10623-026-01933-8","DOIUrl":"https://doi.org/10.1007/s10623-026-01933-8","url":null,"abstract":"Abstract We construct $$mathbb {Z}_p$$ Z p -lattices and $$mathbb {F}_q[![t]!]$$ F q [ [ t ] ] -lattices from cyclic $$(f,sigma )$$ ( f , σ ) -codes over finite chain rings, employing quotients of natural nonassociative orders and principal left ideals in carefully chosen and not necessarily associative algebras. This approach generalizes the classical Construction A that obtains $$mathbb {Z}$$ Z -lattices from linear codes over finite fields or commutative rings to the nonassociative setting. We mostly use (associative or nonassociative) cyclic algebras that are defined over field extensions of p -adic fields. This means we focus on certain skew constacyclic codes over finite rings to obtain $$mathbb {Z}_p$$ Z p -lattices, hence $$mathbb {Z}_p$$ Z p -lattice codes. We construct linear maximum rank distance (MRD) codes that are $$mathbb {Z}_p$$ Z p -lattice codes employing the left multiplication of a nonassociative algebra over a finite chain ring. Possible other applications of our constructions include cryptography involving p -adic lattices, e.g. learning with errors.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"51 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148894503","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Constructions of binary self-orthogonal singly-even wide minimal linear codes with few weights","authors":"Kangquan Li, Hao Chen, Wengang Jin, Longjiang Qu","doi":"10.1007/s10623-026-01921-y","DOIUrl":"https://doi.org/10.1007/s10623-026-01921-y","url":null,"abstract":"","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"36 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2026-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148768980","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}