DOI: 10.1007/978-3-540-87448-5_15
|View full text |Cite
|
Sign up to set email alerts
|

Close Encounters with Boolean Functions of Three Different Kinds

Abstract: Abstract. Complex arrays with good aperiodic properties are characterised and it is shown how the joining of dimensions can generate sequences which retain the aperiodic properties of the parent array. For the case of 2 × 2 × . . . × 2 arrays we define two new notions of aperiodicity by exploiting a unitary matrix represention. In particular, we apply unitary rotations by members of a size-3 cyclic subgroup of the local Clifford group to the aperiodic description. It is shown how the three notions of aperiodic… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Publication Types

Select...
3
1
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 29 publications
0
4
0
Order By: Relevance
“…r , where W = 2 r−1 (m − r + 2). The recursion of Boolean functions in (29) equivalently derives the recursion of generator matrices of…”
Section: Encoding and Decodingmentioning
confidence: 99%
See 1 more Smart Citation
“…r , where W = 2 r−1 (m − r + 2). The recursion of Boolean functions in (29) equivalently derives the recursion of generator matrices of…”
Section: Encoding and Decodingmentioning
confidence: 99%
“…A recursive construction of Boolean functions is then presented for the Reed-Muller subcodes, where the PAPR of the MC-CDMA signal encoded by the subcode is proven to be theoretically bounded. The author of [29] pointed out that the construction is equivalent to Type-III sequences in [29] where he made a general and mathematical study for Boolean functions with bounded PAPR, not considering the application to MC-CDMA. We also discuss a connection between the code rate of the subcode and the maximum PAPR.…”
Section: Introductionmentioning
confidence: 99%
“…, ∀θ ∈ R}, be infinite sets of 2 × 2 unitaries, called type-II, and type-III unitaries, respectively [2], [8], [9]. We can show that…”
Section: Generalised Nonlinearitiesmentioning
confidence: 99%
“…Typical cryptanalysis considers WalshHadamard spectra of Boolean functions, and we examine spectra with respect to more general transform sets. This is one in a series of papers that tackles such ideas [2], [4], [8]- [10]. We also propose two new types of multivariate complementary set to add to the one proposed in [7].…”
Section: Introductionmentioning
confidence: 99%