...
首页> 外文期刊>Designs, Codes and Crytography >On Boolean functions with the sum of every two of them being bent
【24h】

On Boolean functions with the sum of every two of them being bent

机译:关于布尔函数,其中每两个的总和被折算

获取原文
获取原文并翻译 | 示例
           

摘要

A set of Boolean functions is called a bent set if the sum of any two distinct members is a bent function. We show that any bent set yields a homogeneous system of linked symmetric designs with the same design parameters as those systems derived from Kerdock sets. Further we observe that there are bent sets of size equal to the square root of the Kerdock set size which consist of Boolean functions with arbitrary degrees.
机译:如果任意两个不同成员的和为折弯函数,则一组布尔函数称为折弯集合。我们表明,任何弯曲集都会产生链接对称设计的同构系统,该系统具有与从Kerdock集派生的系统相同的设计参数。进一步地,我们观察到,弯曲集的大小等于Kerdock集大小的平方根,它由任意度数的布尔函数组成。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号