• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 3
  • 3
  • 3
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Stabilizer Codes over Frobenius Rings

Nadella, Sushma 2012 May 1900 (has links)
In quantum information processing, the information is stored in the state of quantum mechanical systems. Since the interaction with the environment is unavoidable, there is a need for quantum error correction to protect the stored information. Until now, the methods for quantum error correction were mainly based on quantum codes that rely on the arithmetic in finite fields. In contrast, this thesis aims to develop a basic framework for quantum error correcting codes over a class of rings known as the Frobenius rings. This thesis focuses on developing the theory of stabilizer codes over the Frobenius rings and provides a systematic construction of codes over these rings. A special class of Frobenius rings called finite chain rings will be the emphasis of this thesis. The theory needed for comparing the minimum distance of stabilizer codes over the finite chain rings to that over the fields is studied in detail. This thesis finally derives that the minimum distance of stabilizer codes over finite chain rings cannot exceed the minimum distance over the fields.
2

Equivalence Theorems and the Local-Global Property

Barra, Aleams 01 January 2012 (has links)
In this thesis we revisit some classical results about the MacWilliams equivalence theorems for codes over fields and rings. These theorems deal with the question whether, for a given weight function, weight-preserving isomorphisms between codes can be described explicitly. We will show that a condition, which was already known to be sufficient for the MacWilliams equivalence theorem, is also necessary. Furthermore we will study a local-global property that naturally generalizes the MacWilliams equivalence theorems. Making use of F-partitions, we will prove that for various subgroups of the group of invertible matrices the local-global extension principle is valid.
3

Quantum codes over Finite Frobenius Rings

Sarma, Anurupa 2012 August 1900 (has links)
It is believed that quantum computers would be able to solve complex problems more quickly than any other deterministic or probabilistic computer. Quantum computers basically exploit the rules of quantum mechanics for speeding up computations. However, building a quantum computer remains a daunting task. A quantum computer, as in any quantum mechanical system, is susceptible to decohorence of quantum bits resulting from interaction of the stored information with the environment. Error correction is then required to restore a quantum bit, which has changed due to interaction with external state, to a previous non-erroneous state in the coding subspace. Until now the methods for quantum error correction were mostly based on stabilizer codes over finite fields. The aim of this thesis is to construct quantum error correcting codes over finite Frobenius rings. We introduce stabilizer codes over quadratic algebra, which allows one to use the hamming distance rather than some less known notion of distance. We also develop propagation rules to build new codes from existing codes. Non binary codes have been realized as a gray image of linear Z4 code, hence the most natural class of ring that is suitable for coding theory is given by finite Frobenius rings as it allow to formulate the dual code similar to finite fields. At the end we show some examples of code construction along with various results of quantum codes over finite Frobenius rings, especially codes over Zm.

Page generated in 0.0618 seconds