SETA
2010
Springer
13 years 8 months ago
2010
Springer
SETA
2010
Springer
13 years 8 months ago
2010
Springer
SETA
2010
Springer
13 years 9 months ago
2010
Springer
A sequence a = (a0, a1, a2, · · · , an) is said to be an almost p-ary sequence of period n + 1 if a0 = 0 and ai = ζbi p for 1 ≤ i ≤ n, where ζp is a primitive p-th root of...
SETA
2010
Springer
13 years 9 months ago
2010
Springer
A Hadamard matrix is said to be completely non-cyclic (CNC) if there are no two rows (or two columns) that are shift equivalent in its reduced form. In this paper, we present three...
SETA
2010
Springer
13 years 9 months ago
2010
Springer
SETA
2010
Springer
13 years 9 months ago
2010
Springer
In this paper we start developing a detailed theory of nega– Hadamard transforms. Consequently, we derive several results on negabentness of concatenations, and partially-symmetr...
SETA
2010
Springer
13 years 9 months ago
2010
Springer
Protocol sequences are binary and periodic sequences used in multiple-access scheme for collision channel without feedback. Each user reads out the bits from the assigned protocol ...
SETA
2010
Springer
13 years 9 months ago
2010
Springer
It is a difficult challenge to find Boolean functions used in stream ciphers achieving all of the necessary criteria and the research of such functions has taken a significant d...
SETA
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. In this paper a spectral characterization of the synchronization property of Boolean dynamical systems is provided. Conditions on the spectrum of the next-state function ...