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 42 for “"Explicit constructions"”.
-
Abstract and Explicit Constructions of Jacobian Varieties
… many respects well-studied, working in concrete, explicit ways with abelian varieties continues to be difficult. The issue is that, aside from the case of elliptic curves, it is often difficult to find ways of modelling and understanding these objects in ways amenable to computation. Often, the …
-
Explicit Constructions of Canonical and Absolute Minimal Degree Lifts of Twisted Edwards Curves
… Moreover, an algorithm is described for explicit computations, and some properties of the general formulas are given.</p> <p>Additionally, we define a notion of Minimal and Absolute Minimal Degree Liftings modulo pn and an associated lift of points we call an Edwards Lift. We show how the …
-
Mode decomposition and Fourier analysis of physical fields in homogeneous cosmology
… harmonic analysis and Fourier analysis. Explicit constructions are performed for a variety of situations arising in homogeneous cosmology. A number of results concerning classical and quantum fields known for very restricted situations are generalized to cover almost all cosmological …
-
New coding techniques for distributed storage systems: enabling locality, availability and security
… is of primary interest in storage systems, explicit constructions for locally repairable codes with optimal minimum distance are presented. This dissertation also designs locally repairable codes that minimize repair-bandwidth, i.e., the amount of data downloaded during a node repair, in …
-
Level stripping of genus 2 Siegel modular forms
… our original form. To obtain our results, we use explicit constructions of Eisenstein series and theta functions to adapt ideas from a level stripping result on elliptic modular forms. Furthermore, we give applications of this result to Galois representations and provide evidence for an analog of …
-
Coding Schemes for Distributed Storage Systems
… storage systems. We study properties and constructions of Maximum Distance Separable (MDS) codes, which are widely used in storage applications since they provide the maximum failure tolerance for a given amount of storage overhead. Among the parameters of the code that are important for …
-
Coloring Problems
… colorings and analyze the resulting structure. Explicit constructions are given for n ≤ 54: The thesis concludes with some suggestions towards a general argument.
-
Hash Families and Cover-Free Families with Cryptographic Applications
… separating hash families, and provide new explicit constructions. We then consider three cryptographic applications of hash families and cover-free families. We provide a stronger de nition of anonymity in the context of shared symmetric key primitives and give a new scheme with improved …
-
On highly regular digraphs
… of finite</p> <p>incidence structures to provide explicit constructions of DSRGs. By using this connection between the finite incidence structures and digraphs, we verify the existence and non-existence of $1\frac{1}{2}$-designs with certain parameters by the existence and non-existence of …
-
Free probability tools in the study of zeros of polynomials : application to hypergeometric and q-hypergeometric families.
… on hypergeometric polynomials, providing explicit constructions and a unified framework to analyze several families, including classical orthogonal and multiple orthogonal polynomials. In particular, we obtain new results on the reality and interlacing of zeros; these results are …
-
Fourier Analysis on SU(2)
… convergence of Fourier series. On SU(2) we give explicit constructions for Haar measure and all irreducible unitary representations. For purposes of motivation and comparison we also consider analysis on U(1), the unit circle in the complex plane. In this context, the general theory specializes …
-
The complexity of explicit construction problems
<p>Explicit constructions of pseudorandom objects play a central role in theoretical computer science. Unfortunately, for many properties of interest, while a randomly chosen object would satisfy them with high probability, deterministically constructing such objects remains notoriously …
-
Rational inattention in control of Markov chains
… the quadratic performance objective and present explicit constructions of controllers that achieve this bound. We show that the obvious certainty-equivalent control policy is suboptimal when the information constraints are very severe, and propose another policy that performs better in this …
-
Truncation maps and geometry of deep learning
… and generalization. First, it develops explicit constructions and bounds for ReLU networks in supervised learning, showing how hidden layers can be understood as geometric transformations of the data. A central tool is the truncation map, which provides a representation of feedforward …
-
Total Domination Ratios of Archimedean Lattices
… bounds on their total domination ratios with explicit constructions of total dominating sets and investigate lower bounds via structural and computational analysis involving the external boundaries of subsets of possible total dominating sets.
-
Explicit two-source extractors and more
… of the main contributions of this thesis is an explicit 2-source extractor for min-entropy log^C n, for some constant C. Other results in this thesis include improved ways of extracting random bits from various other sources of randomness, as well as stronger notions of randomness extraction. …
-
Expander Graphs and Coding Theory
… and coding theory. It is a major challenge to explicitly construct sparse graphs with good expansion properties, for example Ramanujan graphs. Nevertheless, explicit constructions do exist, and in this thesis, we survey many of these constructions up to this point including a new construction …
-
Node-Link, Obstacle, and Intersection Representations of Graphs and Hypergraphs
… complexity of most of these problems and provide explicit constructions for specific graph classes.
-
Performance of codes based on crossed product algebras
… from cyclic algebras. Finally in the third part, constructions based on biquadratic crossed product algebras are considered. It is well known that two important design criteria in the construction of spacetime codes are the rank criterion and the determinant criterion. The rank criterion is …
Page 1 of 3