Upper and lower bounds to the ELS of bent-function sequences are derived. The upper bound improves upon Key's upper bound and the lower bound, obtained through ...
The upper bound improves upon Key's upper bound and the lower bound, obtained through construction, and exceeds the limit of the ELS of bent-function ...
Upper and lower bounds to the ELS of bent-function sequences are derived. The upper bound improves upon Key's upper bound and the lower bound, obtained through ...
Upper and lower bounds to the ELS of bent-function sequences are derived. The upper bound improves upon Key's upper bound and the lower bound, obtained through ...
Statements ; instance of · scholarly article. 0 references ; title. Bounds on the linear span of bent sequences (English). 0 references ; author · P. Vijay Kumar.
6 days ago · A recolouring sequence, between k-colourings \alpha and \beta of a graph G, transforms \alpha into \beta by recolouring one vertex at a time, ...
Bounds indicating the maximum-achievable linear span of bent sequences are derived and a count is obtained (under restricted conditions) of the number of ...
Bounds on the linear span of bent sequences · P. V. KumarR. Scholtz ... The upper bound improves upon Key's upper bound and the lower bound, obtained ...
Nov 1, 2023 · In this section we briefly explain why we only use partially bent functions and not arbitrary plateaued functions. Let s ≥ 1 be an integer. Let ...
This dissertation work focuses on study of various nonlinear sequences and their correlation properties. Bounds on correlation functions of signals play a major ...