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 11 of 11 for “"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. Error resilient image transmission using T-codes and edge-embedding

    … this thesis we studied the performance of T-codes in comparison with Huffman codes. We develop an algorithm for the selection of best T-code set. We have shown that T-codes exhibit better synchronization properties when compared to Huffman Codes. In this work we developed an algorithm that …

    wvu Repository record for Error resilient image transmission using T-codes and edge-embedding (opens in a new tab)

  3. Analysis of the families of variable length self synchronising codes called T-codes

    … families of variable length self-synchronising T-Codes are presented. The studies use Monte Carlo computer simulations to analyse the synchronising properties of the T-Codes and the relationships between these and their coding efficiency. Software and hardware implementations of the algorithms …

    auckland-ms Repository record for Analysis of the families of variable length self synchronising codes called T-codes (opens in a new tab)

  4. Robustness of Variable Length Codes

    … the robustness of certain variable length codes in the presence of channel errors. The codes studied are: Huffman, Huffman equivalent, and T-codes. The algorithm used to construct each code is presented, together with appropriate methods of modifying the constructed code. The …

    southwales Repository record for Robustness of Variable Length Codes (opens in a new tab) Download PDF for Robustness of Variable Length Codes (opens in a new tab)

  5. Construction of I-Deletion-Correcting Ternary Codes

    Finding large deletion correcting codes is an important issue in coding theory. Many researchers have studied this topic over the years. Varshamov and Tenegolts constructed the Varshamov-Tenengolts codes (VT codes) and Levenshtein showed the Varshamov-Tenengolts codes are perfect binary …

    brock Repository record for Construction of I-Deletion-Correcting Ternary Codes (opens in a new tab)

  6. The Construction of Variable Length Codes with Good Synchronisation Properties

    … background information on binary variable length codes is given, particularly relating to the problems of compression and synchronisation. A review of the literature on the codes known as Huffman Equivalent codes (HE-codes) and T-codes, reveals many papers that deal with the synchronisation of …

    southwales Repository record for The Construction of Variable Length Codes with Good Synchronisation Properties (opens in a new tab) Download PDF for The Construction of Variable Length Codes with Good Synchronisation Properties (opens in a new tab)

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

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

    … 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 a …

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

  9. Evaluation of intra-set clustering techniques for redundant social media content

    This thesis evaluates various techniques for intra-set clustering of social media data from an industry perspective. The research goal was to establish methods for reducing the amount of redundant information an end user must review from a standard social media search. The research evaluated both …

    uvic Repository record for Evaluation of intra-set clustering techniques for redundant social media content (opens in a new tab)

  10. Fast Low Memory T-Transform: string complexity in linear time and space with applications to Android app store security.

    This thesis presents flott, the Fast Low Memory T-Transform, the currently fastest and most memory efficient linear time and space algorithm available to compute the string complexity measure T-complexity. The flott algorithm uses 64.3% less memory and in our experiments runs asymptotically 20% …

    uvic Repository record for Fast Low Memory T-Transform: string complexity in linear time and space with applications to Android app store security. (opens in a new tab)

  11. Counting prime polynomials and measuring complexity and similarity of information

    This dissertation explores an analogue of the prime number theorem for polynomials over finite fields as well as its connection to the necklace factorization algorithm T-transform and the string complexity measure T-complexity. Specifically, a precise asymptotic expansion for the prime polynomial …

    uvic Repository record for Counting prime polynomials and measuring complexity and similarity of information (opens in a new tab)