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"”.

  1. 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 …

    guelph Repository record for Exploring the Greedy Constructions of de Bruijn Sequences (opens in a new tab)

  2. 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 …

    nps Repository record for On the distribution of complexity for de Bruijn sequences (opens in a new tab)

  3. 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 …

    guelph Repository record for Constructing de Bruijn sequences by concatenating cycles of feedback shift registers (opens in a new tab)

  4. 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 …

    nps Repository record for Double Eulerian cycles on de Bruijn digraphs (opens in a new tab)

  5. 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 …

    waterloo Repository record for Design and Analysis of Cryptographic Pseudorandom Number/Sequence Generators with Applications in RFID (opens in a new tab)

  6. 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 …

    guelph Repository record for Constructing Orientable Sequences Using Cycle Joining Algorithm (opens in a new tab)

  7. 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, …

    iastate Repository record for On the existence and structure of De Bruijn-like sequences (opens in a new tab)

  8. 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 …

    clemson Repository record for Codes and Sequences for Information Retrieval and Stream Ciphers (opens in a new tab)

  9. 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 …

    njit Repository record for Error correction for asynchronous communication and probabilistic burst deletion channels (opens in a new tab)

  10. 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 …

    ttu Repository record for A generalized linear complexity (opens in a new tab)

  11. 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 …

    waterloo Repository record for Optimizations and Hardware Implementations for Composited de Bruijn Sequence Generators (opens in a new tab)

  12. 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 …

    colostate Repository record for Discrete-time topological dynamics, complex Hadamard matrices, and oblique-incidence ion bombardment (opens in a new tab)