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 121 for “"Self Dual"”.

  1. Self-Dual Graphs

    The study of self-duality has attracted some attention over the past decade. A good deal of research in that time has been done on constructing and classifying all self-dual graphs and in particular polyhedra. We will give an overview of the recent research in the first two chapters. In the third …

    waterloo Repository record for Self-Dual Graphs (opens in a new tab)

  2. Strongly self-dual graphs.

    regina Repository record for Strongly self-dual graphs. (opens in a new tab)

  3. A brief survey of self-dual codes

    This report is a survey of self-dual binary codes. We present the fundamental MacWilliams identity and Gleason’s theorem on self-dual binary codes. We also examine the upper bound of minimum weights of self-dual binary codes using the extremal weight enumerator formula. We describe the shadow code …

    texas Repository record for A brief survey of self-dual codes (opens in a new tab)

  4. Towards a self-dual geometric Langlands program

    … [45, 86], I conjecture the existence of a self-dual version of the geometric Langlands program. In the second part of the thesis I study shifted Cartier duality for the moduli of Higgs bundles. The main results are: (1) a criteria for ramification of L-valued cameral covers, (2) a …

    texas Repository record for Towards a self-dual geometric Langlands program (opens in a new tab)

  5. Arithmetic Constructions Of Binary Self-Dual Codes

    … is to explore the interplay between binary self-dual codes and the \'etale cohomology of arithmetic schemes. Three constructions of binary self-dual codes with arithmetic origins are proposed and compared: Construction $\Q$, Construction G and the Equivariant Construction. In this thesis, we …

    penn Repository record for Arithmetic Constructions Of Binary Self-Dual Codes (opens in a new tab)

  6. Self-dual codes, subcode structures, and applications.

    The classification of self-dual codes has been an extremely active area in coding theory since 1972 [33]. A particularly interesting class of self-dual codes is those of Type II which have high minimum distance (called extremal or near-extremal). It is notable that this class of codes contains …

    louisville Repository record for Self-dual codes, subcode structures, and applications. (opens in a new tab)

  7. Double circulant self-dual codes from Legendre sequences

    … the code generated by D=11/1/1/10/S/S over Fq is self-dual. The idempotent elements of the ideals generated by s(x) and s˜(x), the leading polynomials of the p×p matrices S and S˜, respectively, for p = 4kq−1 are investigated and used to find the rank of these matrices over Fq. We define a …

    uvic Repository record for Double circulant self-dual codes from Legendre sequences (opens in a new tab)

  8. Self Dual Codes and the Indecomposable Building Blocks

    … are to integers, indecomposable codes are to self dual codes. This paper gives an explicit listing of the first few families of binary self dual codes, up to length 16. Binary self dual codes that are decomposable are given as a composition of indecomposable codes. The indecomposable codes are …

    eku Repository record for Self Dual Codes and the Indecomposable Building Blocks (opens in a new tab)

  9. A self-dual approach to stochastic partial differential equations

    … first part of this thesis, we use the theory of self-duality to provide a variational approach for the resolution of a number of stochastic partial differential equations. We will be able to address the problem of existence of solutions to a class of semilinear stochastic partial differential …

    ubc Repository record for A self-dual approach to stochastic partial differential equations (opens in a new tab) Download PDF for A self-dual approach to stochastic partial differential equations (opens in a new tab)

  10. The self dual geometries in modified theories of gravity

    We construct a number of new solutions within the modified theories of gravity. We solve and build three new Taub-NUT based solutions, one in f(T) and the other two in f(R). In all cases we examine test particle orbits and in the f(R) solutions black hole thermodynamics. We find both f(R) solutions …

    sask Repository record for The self dual geometries in modified theories of gravity (opens in a new tab)

  11. SELF-DUAL REPRESENTATIONS WITH VECTORS FIXED UNDER AN IWAHORI SUBGROUP

    … 0. Let $\pi$ be an irreducible smooth self-dual representation of $G$. The space $W$ of $\pi$ carries a non-degenerate $G$-invariant bilinear form $(\,,\,)$ which is unique up to scaling. The form is easily seen to be symmetric or skew-symmetric and we set $\varepsilon({\pi})=\pm 1$ …

    oklahoma-thes Repository record for SELF-DUAL REPRESENTATIONS WITH VECTORS FIXED UNDER AN IWAHORI SUBGROUP (opens in a new tab)

  12. Generator Matrix Based Search for Extremal Self-Dual Binary Error-Correcting Codes

    Self-dual doubly even linear binary error-correcting codes, often referred to as Type II codes, are codes closely related to many combinatorial structures such as 5-designs. Extremal codes are codes that have the largest possible minimum distance for a given length and dimension. The existence of …

    brock Repository record for Generator Matrix Based Search for Extremal Self-Dual Binary Error-Correcting Codes (opens in a new tab)

  13. A recursive enumeration of the inequivalent binary (2k,k) self-dual codes, or 2k less than or equal to 32

    A binary self-dual code of length 2k is a (2k, k) binary linear code C with the property that every pair of codewords in C are orthogonal. Two binary self-dual codes of equal length, $C\sb1$ and $C\sb2,$ are said to be equivalent if and only if there exists a permutation of the coordinates of …

    manitoba Repository record for A recursive enumeration of the inequivalent binary (2k,k) self-dual codes, or 2k less than or equal to 32 (opens in a new tab)

  14. Finite Group Actions on Smooth 4-Manifolds with Indefinite Intersection Form

    … actions on S² x S² and its moduli space of anti-self-dual connections will be investigated. In the first step the equivariant version of the Donaldson gluing construction of anti-self-dual connections will be developed. We obtain an equivariant obstruction map which provides an equivariant local …

    mcmaster Repository record for Finite Group Actions on Smooth 4-Manifolds with Indefinite Intersection Form (opens in a new tab)

  15. Inverse and homogenization problems for maximal monotone operators

    We apply self-dual variational calculus to inverse problems, optimal control problems and homogenization problems in partial differential equations. Self-dual variational calculus allows for the variational formulation of equations which do not have to be of Euler-Lagrange type. Instead, a …

    ubc Repository record for Inverse and homogenization problems for maximal monotone operators (opens in a new tab) Download PDF for Inverse and homogenization problems for maximal monotone operators (opens in a new tab)

  16. Twistor theory and scattering amplitudes on strong curved backgrounds

    … colour-ordered MHV form factor around self-dual radiative gauge fields. We construct Killing spinors around a self-dual dyon background and use them to construct plane wavelike linear fields of arbitrary helicity propagating on the background. The twistor description of these fields …

    oxford Repository record for Twistor theory and scattering amplitudes on strong curved backgrounds (opens in a new tab)

  17. Classification of small optimal linear codes over Z₄

    … determined from the optimal codes constructed. Self-orthogonal codes, self-dual codes, isodual codes, formally self-dual codes and codes with linear binary images are identified.

    uvic Repository record for Classification of small optimal linear codes over Z₄ (opens in a new tab)

Page 1 of 7