Designs, Codes and Cryptography最新文献

Cyclic codes and cyclically covering subspaces over finite fields 有限域上的循环码和循环覆盖子空间

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2026-10-01 DOI: 10.1007/s10623-026-01956-1

Yangcheng Li,Pingzhi Yuan

引用次数: 0

Completely regular codes in graphs covered by a Hamming graph 由汉明图覆盖的图中的完全正则代码

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2026-10-01 DOI: 10.1007/s10623-026-01955-2

Sergey Goryainov,Denis Krotov

引用次数: 0

A multiset approach to MacWilliams identities MacWilliams恒等式的多集方法

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2026-10-01 DOI: 10.1007/s10623-026-01951-6

Hopein Christofen Tang

引用次数: 0

Maximal sets of mutually orthogonal frequency squares and Doehlert-Klee designs 互正交频率平方的极大集与Doehlert-Klee设计

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2026-09-27 DOI: 10.1007/s10623-026-01944-5

Carly Bodkin,Nicholas J. Cavenagh,Ian M. Wanless

{"title":"Maximal sets of mutually orthogonal frequency squares and Doehlert-Klee designs","authors":"Carly Bodkin,Nicholas J. Cavenagh,Ian M. Wanless","doi":"10.1007/s10623-026-01944-5","DOIUrl":"https://doi.org/10.1007/s10623-026-01944-5","url":null,"abstract":"Abstract A binary frequency square of type $$(n;lambda _0,lambda _1)$$ ( n ; λ 0 , λ 1 ) is a (0, 1)-matrix of order n with $$lambda _0$$ λ 0 zeros and $$lambda _1$$ λ 1 ones in each row and in each column. Two such squares are orthogonal if there are exactly $$lambda _1^2$$ λ 1 2 cells where both squares contain ones. A set of binary MOFS is a set of binary frequency squares in which each pair is orthogonal. A set of binary MOFS of type $$(n;lambda _0,lambda _1)$$ ( n ; λ 0 , λ 1 ) is type maximal if there is no square of the type $$(n;lambda _0,lambda _1)$$ ( n ; λ 0 , λ 1 ) that is orthogonal to every square in the set. A Doehlert-Klee design consists of points $$mathcal {V}$$ V and blocks $$mathcal {B}$$ B , where every pair of points occurs in precisely $$Lambda $$ Λ blocks and every point occurs in precisely R blocks, where $$R^2=Lambda |mathcal {B}|$$ R 2 = Λ | B | . We show that sets of binary MOFS are equivalent to a particular kind of Doehlert-Klee design. In a distinct application, Doehlert-Klee designs can also be used to construct sets of binary MOFS that are cyclically generated from their first rows. We use these connections to find new constructions for sets of type-maximal binary MOFS.","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"60 1","pages":""},"PeriodicalIF":1.6,"publicationDate":"2026-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149049474","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}

引用次数: 0

A class of locally differentially 4-uniform power functions with Niho exponents 一类具有Niho指数的局部微分4-一致幂函数

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2026-09-27 DOI: 10.1007/s10623-026-01950-7

Haode Yan,Kangquan Li

引用次数: 0

On the minimum length of binary linear codes 关于二进制线性码的最小长度

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2026-09-27 DOI: 10.1007/s10623-026-01947-2

Tatsuya Maruta,Taiki Tochiyama,Keita Yasufuku

引用次数: 0

Infinite families of $$textrm{t}$$-error-correcting binary cyclic codes from sparse polynomials over $$mathbb {F}_{2^n}$$ 从稀疏多项式的无穷族$$textrm{t}$$ -纠错二进制循环码 $$mathbb {F}_{2^n}$$

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2026-09-27 DOI: 10.1007/s10623-026-01949-0

Yan-Ping Wang,Dengguo Feng

引用次数: 0

Embedding linear codes over $${mathbb {Z}}_4$$ into self-orthogonal codes 在$${mathbb {Z}}_4$$上嵌入线性代码到自正交代码中

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2026-09-27 DOI: 10.1007/s10623-026-01948-1

Junmin An,Jon-Lark Kim,San Ling

引用次数: 0

Unbounded quadratic functional encryption and more from pairings 无界二次函数加密和更多的配对

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2026-09-27 DOI: 10.1007/s10623-026-01928-5

Junichi Tomida

引用次数: 0

On the combinatorial complexity of bounded sparse Learning With Errors (sLWE) 带误差有界稀疏学习的组合复杂度

IF 1.6 2区数学

Designs, Codes and Cryptography Pub Date : 2026-09-25 DOI: 10.1007/s10623-026-01938-3

Abul Kalam,Santanu Sarkar,Willi Meier

引用次数: 0