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 3 of 3 for “"CSS-T Codes"”.

  1. Constructing CSS-T Codes from Extended Quasi-Cyclic Codes

    We analyze a construction of quasi-cyclic codes in an extension field based on the polynomials which generate the corresponding codes in the base fields. We establish a set of code operations on which trace relationships between extended quasi-cyclic codes are the same as the operations taken on …

    vt Repository record for Constructing CSS-T Codes from Extended Quasi-Cyclic Codes (opens in a new tab)

  2. Commutative algebra and coding theory, with applications to quantum error-correction

    … Algebra to derive properties of linear codes. We focus mainly on evaluation codes, since they have a natural connection to Commutative Algebra, but we also consider other types of codes such as cyclic codes (which can be viewed as subfield subcodes of evaluation codes) or matrix-product …

    valladolid Repository record for Commutative algebra and coding theory, with applications to quantum error-correction (opens in a new tab)

  3. A New Family of Fault Tolerant Quantum Reed-Muller Codes

    … tolerant computation. Rengaswamy et. al. define CSS-T codes, which are CSS codes that admit the transversal application of the T gate, which is a key step in achieving fault tolerant computation. They then present a family of quantum Reed-Muller fault tolerant codes. Their family of codes admits …

    clemson Repository record for A New Family of Fault Tolerant Quantum Reed-Muller Codes (opens in a new tab)