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 20 of 99 for “"Linear complexity"”.
-
A generalized linear complexity
… strong sequence must have a high linear complexity, where the linear complexity of a sequence s is the minimum number of stages in a linear feedback shift register capable of generating s. However, trivial examples exist which show that a high linear complexity does not insure that …
-
Stream ciphers and linear complexity
… introduce thealgebraic tools for the analysis of linear recurring sequences followed by discussions on the two kinds of basic nonlinear filters.Also, we will discuss the randomness of the sequences over $\mathbb{F}_{q}$ and justify the use of linear complexity profiles to measure the randomness of …
-
Sequence Modeling with Linear Complexity
… drawback of self-attention is the quadratic time complexity O(n^2) for the processing of a sequence that it requires. This makes self-attention expensive and slow when it comes to long sequences. In this thesis, we aim to reduce this complexity to linear time without using attention and we …
-
Studies on error linear complexity measures for multisequences
In this thesis we develop a theory of $k$-error linearcomplexity for multisequences by introducing three new complexity measures,namely $k$-error joint linear complexity, $k$-error $\mathbb{F}_q$-linearcomplexity and $\vec{\bf k}$-error joint linear complexity. We find analogsof some of the known …
-
In pursuit of linear complexity in discrete and computational geometry
… meshes, and (iii) bounding the expected complexity of weighted Voronoi diagrams. While these topics are broad, here the focus is on identifying structure which implies linear (or near linear) algorithmic and descriptive complexity. The first topic we consider is in geometric optimization. …
-
One-dimensional cellular automata and shrinking generators for pseudorandom sequence generation
Linear feedback shift registers (LFSRs) based on primitive polynomials are commonly used to generate maximum length sequences (m-sequences). These pseudorandom sequences demonstrate desirable randomness properties such as balance, run, and autocorrelation while exhibiting low linear complexity. …
-
Two dimensional cellular automata and pseudorandom sequence generation
Maximum linear feedback shift registers (LFSRs) based on primitive polynomials are commonly used to generate maximum length sequences (m-sequences). An m-sequence is a pseudorandom sequence that exhibits ideal randomness properties like balance, run and autocorrelation but has low linear …
-
Τεχνικές επεξεργασίας σήματος στην κρυπτογραφία
… cryptographic algorithms. Shift registers with linear (LFSR) or nonlinear (FSR) feedback are the basic building blocks in stream ciphers. The security of these systems is mainly attributed to pseudorandom characteristics of the keystreams. Amongst the cryptographic measures of a sequence is its …
-
Cellular automata pseudorandom sequence generation
… balance, run and autocorrelation. However, the linear complexity of m-sequences is poor. This thesis considers the use of one-dimensional Cellular Automata (CA) to generate pseudorandom sequences that have high linear complexity and good randomness. The properties of these sequences are compared …
-
A Character Formula for the Sidelnikov-Lempel-Cohn-Eastman Sequences
… also consider the problem of determining the linear complexity of the SLCE sequences. Due to certain technical considerations, this problem is rather difficult and has resisted the efforts of a number of mathematicians over the past 15 years. Making use of our character formula together with …
-
Parallel Methods for the Solution of Large-Scale Radiation and Inverse Scattering Problems
… forward problem to compute an image. With the linear complexity offered by the MLFMA forward solver, DBIM reconstructions proceed with greatly-reduced computation. This allows the solution of very large inverse-scattering problems.
-
Design and Analysis of Cryptographic Pseudorandom Number/Sequence Generators with Applications in RFID
… 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 searching in which an NLFSR with a class of feedback functions …
-
Interleaved Sequences Over Finite Fields
… such as correlation, correlation measure and linear complexity profile of the sequences defined by characters with interleaved structure. Families of pseudorandom sequences with low cross correlation have important applications in communications and cryptography. Among several known …
-
Fast direct algorithms for elliptic equations via hierarchical matrix compression
… a fast direct algorithm for the solution of linear systems arising from elliptic equations. We extend the work of Xia et al. (2009) on combining the multifrontal method with hierarchical matrices. We offer a more geometric interpretation of that approach, extend it in two dimensions to the …
-
Code design and multiuser detection for code division multiple access systems with continuous phase modulation
… is briefly analyzed and its computational complexity is shown to be prohibitively large for practical applications. For this reason, the emphasis is placed on suboptimum detectors with linear complexity and near-optimum performance. The choice of an appropriate set of decision statistics is …
-
An Empirical Study of NIN-AND Tree Elicitation
… must be acquired from the domain experts. The complexity of the direct elicitation is exponential on the number of parents of a variable, making direct elicitation from human experts impractical for a large number of causes. Causal models such as Noisy-OR, Noisy-AND, Noisy-MIN, Noisy-MAX and …
-
Hierarchical Matrix Techniques on Massively Parallel Computers
… and matrix inversion can be done in almost linear complexity. In this work, we tried to gain even further speedup for the H-matrix arithmetic by utilizing multiple processors. Our approach towards an H-matrix distribution relies on the splitting of the index set. The main results achieved in …
-
Accurate and Efficient Representation Learning on Large-Scale Graphs
… an expressive graph transformer model with linear complexity. We theoretically demonstrate the superior expressivity of Polynormer through the lens of polynomial functions. Our extensive experiments indicate that Polynormer not only achieves state-of-the-art results across a wide variety of …
Page 1 of 5