Generating and counting binary bent sequences

Generating and counting binary bent sequences

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, the authors conjecture a lower bound on the total number of binary b...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory 1990-09, Vol.36 (5), p.1170-1173
Hauptverfasser: Adams, C.M., Tavares, S.E.
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Boolean functions
Codes
Cryptography
Digital communication
Equations
Exact sciences and technology
Fourier transforms
Hamming weight
Information, signal and communications theory
Logic
Signal and communications theory
Signal, noise
Spread spectrum communication
Telecommunications and information theory
Terrorism
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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, the authors 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.< >
ISSN:0018-9448
1557-9654
DOI:10.1109/18.57222