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 20 for “"Code Construction"”.

  1. Maximal Code Construction for Communications Channels With Symmetric or Asymmetric Noise

    Made available in DSpace on 2014-12-08T22:23:52Z (GMT). No. of bitstreams: 1 6604227.pdf: 3430333 bytes, checksum: 820f8ef688a8d96162a5d693f6c8e3cf (MD5) Previous issue date: 1965

    uiuc Repository record for Maximal Code Construction for Communications Channels With Symmetric or Asymmetric Noise (opens in a new tab)

  2. Simplified random network codes for multicast networks

    … on the work done on random linear network codes, we develop a constrained, simplified code construction suitable for multicast in wireless networks. We analyze bounds on sufficient code size and code success probability via an algebraic framework for network coding. We also present …

    mit Repository record for Simplified random network codes for multicast networks (opens in a new tab)

  3. Increasing quality of service using transport layer coding over parallel heterogeneous networks

    … erasures. The potential gains of a network coded transport layer are first introduced using two protocols: Coded TCP (CTCP) and Multi-Path TCP with Network Coding (MPTCP/NC). These two approaches help illustrate different methods to implement network coding to help overcome packet losses and …

    mit Repository record for Increasing quality of service using transport layer coding over parallel heterogeneous networks (opens in a new tab)

  4. Quantum Algebraic Geometry Codes

    … and decoherence. This thesis investigates the construction of quantum error correction codes derived from classical algebraic geometry (AG) codes. We present two distinct construction techniques, highlighting the flexibility and self-orthogonality of AG codes, and demonstrate their ability to …

    rice Repository record for Quantum Algebraic Geometry Codes (opens in a new tab)

  5. Quantum Computing from Graphs

    … as a descriptive tool for additive quantum codes, they otherwise offer little guidance for concrete constructions or coding algorithm analysis. We introduce a representation of stabilizer codes as graphs with certain structures. Specifically, the graphs take a semi-bipartite form wherein …

    mit Repository record for Quantum Computing from Graphs (opens in a new tab)

  6. A influência da evolução dos códigos edilícios na qualidade ambiental dos projetos residenciais multifamiliares: o caso das subzonas A-2 e A-18 da Barra da Tijuca no período de 1960 a 2004

    … city of Rio de Janeiro, emphasizing mainly the Code model express by Residential Regulation of Construction and Edification, considering its inductor aspect. This Regulation regulates and gives minimal legal direction for its execution for later approve and give concession permission to occupy …

    brazil-uerj Repository record for A influência da evolução dos códigos edilícios na qualidade ambiental dos projetos residenciais multifamiliares: o caso das subzonas A-2 e A-18 da Barra da Tijuca no período de 1960 a 2004 (opens in a new tab)

  7. Polar Coding in Certain New Transmission Environments

    Polar codes, introduced by Arikan in 2009, have attracted considerable interest as an asymptotically capacity-achieving code with sufficient performance advantages to merit inclusion in the 5G standard. Polar codes are constructed directly from an explicit model of the communication channel, so …

    vt Repository record for Polar Coding in Certain New Transmission Environments (opens in a new tab)

  8. Multiple access networks over finite fields : optimality of separation, randomness and linearity

    … We derive the capacity region and the maximum code rate for the noisy as well as noise-free channel where, code rate is defined as the ratio of the information symbols recovered at the receiver to the symbols sent by the transmitters in a slot duration. Code rate measures the overhead in …

    mit Repository record for Multiple access networks over finite fields : optimality of separation, randomness and linearity (opens in a new tab)

  9. Codes from norm-trace curves: local recovery and fractional decoding

    Codes from curves over finite fields were first developed in the late 1970's by V. D. Goppa and are known as algebraic geometry codes. Since that time, the construction has been tailored to fit particular applications, such as erasure recovery and error correction using less received information …

    vt Repository record for Codes from norm-trace curves: local recovery and fractional decoding (opens in a new tab)

  10. Network coding for robust wireless networks

    … in wireless networks with the following network coded designs. -- Algebraic NC exploits strategic interference to provide a distributed, randomized code construction for multi-user wireless networks. Network coding framework simplifies the multi-user wireless network model, and allows us to …

    mit Repository record for Network coding for robust wireless networks (opens in a new tab)

  11. Iterative decoding for rate adaptive forward error correction on the mobile satellite channel.

    … examine rate adaptive forward error correction codes for the mobile satellite channel. We are especially interested in codes that can be iteratively decoded. Multilevel coded modulations are considered: partitioning of constellations, coding principle and iterative decoding are studied. We …

    ottawa-retro Repository record for Iterative decoding for rate adaptive forward error correction on the mobile satellite channel. (opens in a new tab)

  12. A study of covert queueing channels in shared schedulers

    … we propose a practical finite-length code construction, which achieves the capacity limit.

    uiuc Repository record for A study of covert queueing channels in shared schedulers (opens in a new tab)

  13. Low-density parity-check codes : construction and implementation.

    Low-density parity-check (LDPC) codes have been shown to have good error correcting performance approaching Shannon’s limit. Good error correcting performance enables efficient and reliable communication. However, a LDPC code decoding algorithm needs to be executed efficiently to meet cost, time, …

    adelaide Repository record for Low-density parity-check codes : construction and implementation. (opens in a new tab)

  14. Code design for the relay channel

    … schemes for two relay protocols - decode-and-forward and estimate-and-forward. In each case, the starting point is an optimal but non-constructive information theoretic random coding scheme, which motivates a practical code construction. Novel code design princi ples and some …

    rice Repository record for Code design for the relay channel (opens in a new tab)

  15. Analysis and modeling of roofer and steel worker fall accidents

    … <p>There are more than nine million construction workers in the US. Roofers and steel workers are the highest risk construction trades according to BLS, and fall from elevation accounts for a large percentage of fatalities and injuries among the construction trades.</p> <p>In this …

    wayne-thes Repository record for Analysis and modeling of roofer and steel worker fall accidents (opens in a new tab)

  16. Assignment of Spreading Codes in Code Division Multiple Access Radio Systems

    This thesis is concerned with spreading code construction and assignment in Direct Sequence Code Division Multiple Access radio systems. Particular emphasis is given to Quasi-Synchronous Code Division Multiple Access. The frequency spectrum required for these systems depends on the length of the …

    southwales Repository record for Assignment of Spreading Codes in Code Division Multiple Access Radio Systems (opens in a new tab)

  17. Codes for Synchronization in Channels and Sources with Edits

    … problem. Varshamov-Tenengolts (VT) codes are first introduced. These codes can correct a single deletion or insertion and have a linear-time decoder. The problem of efficient encoding of the non-binary version of VT codes is addressed, where a simple linear-time encoding method to …

    cambridge Repository record for Codes for Synchronization in Channels and Sources with Edits (opens in a new tab)

  18. Toward sustainable networking : coded storage and high-traffic networks

    … and concurrently serving thousands of users. Coded storage is a strategy proposed in the last decade, which may be able to improve performance of these growing systems. Broadly, we classify storage systems into those that can be modeled as static, or as traffic-agnostic, and those that are …

    mit Repository record for Toward sustainable networking : coded storage and high-traffic networks (opens in a new tab)

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

  20. New group testing paradigms: from practice to theory

    … We describe combinatorial and probabilistic constructions for such matrices without considering any restriction on the thresholds of the SQGT model (i.e. SQGT with arbitrary thresholds). Then, we focus on the important special case in which the thresholds are equidistant, and construct …

    uiuc Repository record for New group testing paradigms: from practice to theory (opens in a new tab)