On (2<sup>m</sup> + 1)-variable symmetric Boolean functions with submaximum algebraic im

来源 :中国科学:数学英文版 | 被引量 : 0次 | 上传用户:ceolq
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
All (2m +1)-variable symmetric Boolean functions with submaximal algebraic immunity 2m-1 are described and constructed. The total number of such Boolean functions is 32 ·22m-3 +3m-2 · 24 - 2 for m≥2.
其他文献
Let X = C\{0,1} and X = X\{}. We get a necessary and suficient condition on the position of  in X such that X has stable Teichmller mappings. Furthermor
This paper provides a conceptual and non-rigorous description of the fast multipole methods for evaluating convolution kernel functions with source distribution
In this paper, one-dimensional (1D) nonlinear Schrdinger equation iut-uxx + Mσ u + f ( | u | 2 )u = 0, t, x ∈ R , subject to periodic boundary conditions is
In this paper, we propose a new criterion, named PICa, to simultaneously select explanatory variables in the mean model and variance model in heteroscedastic li
Let DerA be the Lie algebra of derivations of the d-torus A = C[t1&#177; 1, . . . , td&#177;1]. By applying Shen-Larsson’s functors we get a class of indecompo
It is common in statistical practice that one needs to make a choice among m + 1 mutually exclusive claims on distributions.When m=1,it is done by the (traditio
我们在等级 1 退化给的主要极化的 abelian 变化的 moduli 的部分 compactification 上为本地系统的 Eisenstein cohomology 给一个公式。
We present two constructions for binary self-orthogonal codes. It turns out that our constructions yield a constructive bound on binary self-orthogonal codes. I
This is a survey of some recent progress in the theory of groups with factorizations. Some of the methods can be used to obtain information about finite groups
我们在 2 由等级 r n 向量的 1 全球节绑的 r n +的楔的零个集合为零维的 subscheme 定义的尺寸 n 的复杂射影的光滑的变化上学习 Cayley-Bacharach 性质,并且从 codimensio