GENERATING AND COUNTING BINARY BENT SEQUENCES

被引：38

作者：

ADAMS, CM

TAVARES, SE

机构：

[1] Department of Electrical Engineering, Queen’s University at Kingston, Kingston, ON

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1990年 / 36卷 / 05期

关键词：

D O I：

10.1109/18.57222

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Two general classes of binary bent sequences, “bent-based” and “linear-based” are introduced. Algorithms that allow easy generation of bent sequences from either class are given. Based on some simple computation and a computer search we conjecture a lower bound on the total number of binary bent sequences of a given order. This lower bound is exact for bent sequences of order 16; a list is included from which all such sequences can be derived. © 1990 IEEE

引用

页码：1170 / 1173

页数：4

共 14 条

[1] A NEW GENERAL CONSTRUCTION FOR GENERALIZED BENT FUNCTIONS [J].