Constructing and Counting Boolean Functions on Even Variables with Maximum Algebraic Immunity
スポンサーリンク
概要
- 論文の詳細を見る
A method to construct Boolean functions with maximum algebraic immunity have been proposed in [1]. Based on that method, we propose a different method to construct Boolean functions on even variables with maximum algebraic immunity in this letter. By counting on our construction, a lower bound of the number of such Boolean functions is derived, which is the best among all the existing lower bounds.
- （社）電子情報通信学会の論文
- 2010-03-01
著者
-
Yang Min
Shanghai Research Center For Modernization Of Traditional Chinese Medicine Shanghai Institute Of Mat
-
Li Yuan
Shanghai Dianji Univ. Shanghai Chn
-
Kan Haibin
Shanghai Key Laboratory Of Intelligent Information Processing School Of Computer Science Fudan Unive
-
Yang Min
Shanghai Key Laboratory Of Intelligent Information Processing School Of Computer Science Fudan Unive
-
Li Yuan
Shanghai Key Laboratory Of Intelligent Information Processing School Of Computer Science Fudan Unive
-
Kan Haibin
Shanghai Key Laboratory Of Intelligent Information Processing School Of Computer Science Fudan Unive
-
Kan Haibin
Shanghai Key Laboratory Of Intelligent Information Processing And Institute Of Theoretical Computer Science School Of Computer Science Fudan University
関連論文
- Quantum Anonymous Voting Systems Based on Entangled State
- Development of the fingerprints for the quality of the roots of Salvia miltiorrhiza and its related preparations by HPLC-DAD and LC-MS^n
- Interaction of Ganoderma triterpenes with doxorubicin and proteomic characterization of the possible molecular targets of Ganoderma triterpenes
- Constructing and Counting Boolean Functions on Even Variables with Maximum Algebraic Immunity
- Space-Time Block Codes from Quasi-Orthogonal Designs with Maximal Rate or Minimal Decoding Complexity
- An Efficient Interpolation Based Erasure-Only Decoder for High-Rate Reed-Solomon Codes