Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 12 of 12 for “"de Bruijn sequences"”.
-
Exploring the Greedy Constructions of de Bruijn Sequences
A k-ary de Bruijn sequence of order n is a cyclic sequence of length k^n such that each k-ary string of length n appears exactly once as a substring. These sequences have applications in a variety of fields, and can be constructed by a number of means, including graph based approaches, linear …
-
On the distribution of complexity for de Bruijn sequences
Binary sequences have had application in communication systems for many years. Shift registers have been used in their generation, because of the ease and economy of their operation. For certain applications, nonlinear feedback functions are used by shift registers of span n to generate sequences …
-
Constructing de Bruijn sequences by concatenating cycles of feedback shift registers
… we introduce sufficient conditions for when an ordering of universal cycles for disjoint sets can be concatenated to obtain a universal cycle for the union of those sets. A $k$-ary de Bruijn sequence of order $n$ is a universal cycle where $\mathbf{S}$ is the set of all $k$-ary strings of length …
-
Double Eulerian cycles on de Bruijn digraphs
A binary de Bruijn sequence has the property that every n-tuple is distinct on a given period of length 2". An efficient algorithm to generate a class of classical de Bruijn sequences is given based upon the distance between cycles within the Good - de Bruijn digraph. The de Bruijn property on …
-
Design and Analysis of Cryptographic Pseudorandom Number/Sequence Generators with Applications in RFID
This thesis is concerned with the design and analysis of strong de Bruijn sequences and span n sequences, and nonlinear feedback shift register (NLFSR) based pseudorandom number generators for radio frequency identification (RFID) tags. We study the generation of span n sequences using structured …
-
Constructing Orientable Sequences Using Cycle Joining Algorithm
A de Bruijn sequence of order n is a cyclic sequence that stretches to a length of 2^n, where each string of length n is featured exactly once as a substring. Orientable sequences are a relative type of de Bruijn sequences that necessitate every substring to not only appear just once but also to be …
-
On the existence and structure of De Bruijn-like sequences
A De Bruijn sequence is a cycle that covers each word in A^n exactly once for some alphabet A and word length n. A universal partial cycle (or upcycle) is a generalization thereof, where in addition to alphabet letters, an upcycle is permitted to include diamond characters that act as a wildcard, …
-
Codes and Sequences for Information Retrieval and Stream Ciphers
Given a self-similar structure in codes and de Bruijn sequences, recursive techniques may be used to analyze and construct them. Batch codes partition the indices of code words into m buckets, where recovery of t symbols is accomplished by accessing at most tau in each bucket. This finds use in the …
-
Error correction for asynchronous communication and probabilistic burst deletion channels
… a wireless sensor operating in "always-on" mode, which increases the power consumption of sensors significantly. Asynchronous communication is an emerging low-power approach for these applications because it provides a larger potential of significant power savings for recording sparse …
-
A generalized linear complexity
… cryptographic applications require pseudo-random sequences which are "unpredictable," in the sense that recovering the sequence from a short captured segment is computationally infeasible. Such sequences are said to be cryptographically strong. Due to the Berlekamp-Massey algorithm, a …
-
Optimizations and Hardware Implementations for Composited de Bruijn Sequence Generators
A binary de Bruijn sequence with period 2^n is a sequence in which every length-n sub-sequence occurs exactly once. de Bruijn sequences have randomness properties that make them attractive for pseudorandom number generators. Unfortunately, it is very difficult to find de Bruijn sequence generators …
-
Discrete-time topological dynamics, complex Hadamard matrices, and oblique-incidence ion bombardment
… covered in this dissertation are not unified under a single mathematical discipline. However, the questions posed and the partial solutions to problems of interest were heavily influenced by ideas from dynamical systems, mathematical experimentation, and simulation. Thus, the chapters in this …