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 14 of 14 for “"Self-dual codes"”.

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

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

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

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

  5. Self Dual Codes and the Indecomposable Building Blocks

    … prime numbers 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 …

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

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

  7. Classification of small optimal linear codes over Z₄

    … the construction and classification of Z4 linear codes for lengths up to 7. Three distance metrics are considered, Lee distance, Hamming distance and Euclidean distance. The inequivalent codes are determined from the optimal codes constructed. Self-orthogonal codes, self-dual codes, isodual codes, …

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

  8. The expected value for the probability of an undetected error using a linear code over an unknown binary symmetric channel

    … on the weight enumerator of the code and its dual code are given to minimize the expected value for the probability of an undetected error. A necessary condition for good error detection is presented based on the expected value for the probability of an undetected error. Several new identities …

    hawaii Repository record for The expected value for the probability of an undetected error using a linear code over an unknown binary symmetric channel (opens in a new tab)

  9. Συνδυαστική θεωρία σχεδιασμών, κωδίκων και κρυπτογραφίας

    … ``Coding Theory'', some special families of codes are studied, namely the self-dual and quasi-cyclic codes, construction methods of the later codes are proposed using designs and genetic algorithms are utilized in the case of the quasi-cyclic codes for determining their parameters. In …

    greece Repository record for Συνδυαστική θεωρία σχεδιασμών, κωδίκων και κρυπτογραφίας (opens in a new tab)

  10. Finite Groups, Polymatroids, and Error-Correcting Codes

    … Jesse MacWilliams published formulas for linear codes that, among other applications, were incredibly valuable in the study of self-dual codes. Now called the MacWilliams Identities, her results relate the weight and complete weight enumerators of a code to those of its dual code. Similar …

    cornell Repository record for Finite Groups, Polymatroids, and Error-Correcting Codes (opens in a new tab)

  11. Equivalence and duality for rank-metric and matrix codes

    … and Kschischang propose the use of subspace codes to provide error correction in the network coding context. The primary construction for subspace codes is the lifting of rank-metric or matrix codes, a process that preserves the structural and distance properties of the underlying code. Thus, …

    nebraska Repository record for Equivalence and duality for rank-metric and matrix codes (opens in a new tab)

  12. Independent Trivariate Bicycle Codes and Hyperbolic Codes

    … noise and planar connectivity, but it encodes only one logical qubit per patch, with an encoding rate $k/n$ that approaches zero as code size increases. Finding codes with better encoding rates, higher distances, and practical thresholds under realistic noise models is a central problem …

    duke Repository record for Independent Trivariate Bicycle Codes and Hyperbolic Codes (opens in a new tab)

  13. Classical Coding Approaches to Quantum Applications

    … transmission, if classical error-correcting codes are employed over this channel, then one needs to develop receivers that collectively measure all output qubits in order to optimally identify the transmitted message. In general, it is hard to determine these optimal collective measurements …

    duke Repository record for Classical Coding Approaches to Quantum Applications (opens in a new tab)