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 “"LT codes"”.

  1. Soliton-Like LT Codes over GF(4) and GF(8)

    The Luby Transform (LT) codes are the first practical realization of fountain codes. LT codes were designed for efficient use over erasure channels. However, the degree distributions designed for the Binary Erasure Channel (BEC), such as the Robust Soliton Distribution (RSD) which are …

    queens Repository record for Soliton-Like LT Codes over GF(4) and GF(8) (opens in a new tab)

  2. Loop transversal codes

    … discusses the performance of loop transversal codes (LT codes), linear error correcting block codes constructed with attention to the syndrome function rather than to the code itself. LT codes are compared to lexicodes. Binary lexicodes which are linear are shown to be identical to those LT …

    iastate Repository record for Loop transversal codes (opens in a new tab)

  3. Improving the Left Degree Distribution of Fountain Codes in the Finite-Length Regime

    Fountain codes were introduced to provide higher reliability, lower complexities, and more scalability for networks such as the Internet. In this thesis, we study Luby- Transform (LT) codes which are the realization of Fountain codes. In the LT codes, a sparse random factor graph is dynamically …

    queens Repository record for Improving the Left Degree Distribution of Fountain Codes in the Finite-Length Regime (opens in a new tab)

  4. Design Of Fountain Codes With Error Control

    … via a comrelay by using distributed lt codes over a binary erasure channel (bec), and designing fountain codes with error control property by integrating lt codes with turbo codes over a binary input additive white gaussian noise (bi-awgn) channel. A simple yet efficient technique for …

    mississippi Repository record for Design Of Fountain Codes With Error Control (opens in a new tab)

  5. LT Code Equations

    The LT Code equations describe the process of encoding input symbols into an error correcting code that requires no feedback from the receiver. The mathematical process involved the development of LT Codes is important. This thesis address the issue of improving the understanding of the LT Code …

    mississippi Repository record for LT Code Equations (opens in a new tab)

  6. Memory Based Luby Transform Encoders for Delay Sensitive Communications

    … transmitted in relatively short block-lengths. LT codes, the first practical realization and the fundamental core of fountain codes, play a key role in the fountain codes family. Recently, researchers show that the performance of LT codes with relatively short lengths can be improved by adding …

    ku Repository record for Memory Based Luby Transform Encoders for Delay Sensitive Communications (opens in a new tab)

  7. On The Design Of Physical Layer Rateless Codes

    Codes that are capable of generating any number of encoded symbols from a given number of source symbols are called rateless codes. Luby transform (LT) codes are the first practical realization of rateless codes while Raptor codes are constructed by serially concatenating LT codes with high-rate …

    mississippi Repository record for On The Design Of Physical Layer Rateless Codes (opens in a new tab)

  8. Overlapped Fountain Coding: Design and Analysis

    The concept of fountain codes has gained considerable attention in the past few years due to its simplicity, reliability, and feasibility. Nowadays, fountain codes are used in many applications including, but not limited to, data storage, data broadcasting, and point-to-point communications. While …

    queens Repository record for Overlapped Fountain Coding: Design and Analysis (opens in a new tab)

  9. Making Coding Practical: From Servers to Smartphones

    … them is random network coding with random linear codes, in which a node in a network topology transmits a linear combination of incoming, or source, packets to its outgoing links. Theoretically, the high computational complexity of random linear codes (RLC) is well known, and is used to motivate …

    toronto-retro Repository record for Making Coding Practical: From Servers to Smartphones (opens in a new tab)

  10. Loop transversal codes over finite rings

    … the concept of loop transversals to linear codes. The set of errors is given the structure of a loop transversal to the linear code as a subgroup of the channel. A greedy algorithm for specifying the loop structure, and thus for the construction of loop transversal codes, was discussed in …

    iastate Repository record for Loop transversal codes over finite rings (opens in a new tab)

  11. Rateless Coding for Single-Source Networks with Common Information

    … the communication problem of a single source simultaneously transmitting to multiple receivers whose sets of requested messages overlap. For decades, one of the challenges in this broadcast setting has been decreasing the number of transmissions from the source to the terminals without increasing …

    queens Repository record for Rateless Coding for Single-Source Networks with Common Information (opens in a new tab)

  12. Distributed Data Storage System for Data Survivability in Wireless Sensor Networks

    … (DDSSs) for WSNs using decentralized erasure codes. A unique aspect of WSNs is that their data is inherently decentralized. This calls for a decentralized mechanism for encoding and decoding. We propose a distributed data storage framework to increase data survivability in WSNs. The framework …

    queens Repository record for Distributed Data Storage System for Data Survivability in Wireless Sensor Networks (opens in a new tab)

  13. Exit charts based analysis and design of rateless codes for the erasure and Gaussian channels

    Luby Transform Codes were the first class of universal erasure codes introduced to fully realize the concept of scalable and fault‐tolerant distribution of data over computer networks, also called Digital Fountain. Later Raptor codes, a generalization of the LT codes were introduced to trade off …

    tamu Repository record for Exit charts based analysis and design of rateless codes for the erasure and Gaussian channels (opens in a new tab)

  14. Unequal Error Protection Raptor Codes

    We design Unequal Error Protection (UEP) Raptor codes with the UEP property provided by the precode part of Raptor codes which is usually a Low Density Parity Check (LDPC) code. Existing UEP Raptor codes apply the UEP property on the Luby transform (LT) code part of Raptor codes. This approach …

    mississippi Repository record for Unequal Error Protection Raptor Codes (opens in a new tab)

  15. Low-Complexity Soliton-like Network Coding for a Resource-Limited Relay

    … applications like sensor networks. A good alternative to Gaussian elimination is for the sink to apply the well-known belief propagation (BP) algorithm; however, the performance and complexity of BP decoding is dependent on the statistics of the linearly-combined packets. In this work, we …

    queens Repository record for Low-Complexity Soliton-like Network Coding for a Resource-Limited Relay (opens in a new tab)

  16. Multimedia communication over mobile IP wireless networks

    … wireless transmission is increasing as novel multimedia applications are being deployed. Mobile wireless channels and IP based communications are inherently prone to errors and packet losses. Error resilience features and Forward Error Correction (FEC) at the application layer (AL) are often …

    strathclyde Repository record for Multimedia communication over mobile IP wireless networks (opens in a new tab)

  17. Fountain codes: performance analysis and optimization

    … the optimisation of the degree distribution of LT coding, the first universal fountain coding method, for small file sizes. We present exact analysis for LT codes of very small size with some novel results. A simulation based method is presented for the analysis and optimisation of longer codes, …

    aalto Repository record for Fountain codes: performance analysis and optimization (opens in a new tab)

  18. Coding and scheduling in networks for erasures and broadcast

    … perspective. A class of efficient and flexible codes known as fountain codes, is available to deal with erasures for the basic erasure channel. However, in the network applications that we consider, it remains a challenging problem to design efficient and scalable codes. For an erasure code, the …

    uiuc Repository record for Coding and scheduling in networks for erasures and broadcast (opens in a new tab)

  19. Trapping Sets in Fountain Codes over Noisy Channels

    Fountain codes have demonstrated great results for the binary erasure channel and have already been incorporated into several international standards to recover lost packets at the application layer. These include multimedia broadcast/multicast sessions and digital video broadcasting on global …

    queens Repository record for Trapping Sets in Fountain Codes over Noisy Channels (opens in a new tab)

  20. Coding for wireless ad-hoc and sensor networks: unequal error protection and efficient data broadcasting

    … schemes, namely low-density parity-check (LDPC) codes and rateless codes for unequal error protection (UEP). It also studies the application of modern error-control codes in efficient data dissemination in wireless ad-hoc and sensor networks. Two methodologies for the design and analysis of …

    gatech Repository record for Coding for wireless ad-hoc and sensor networks: unequal error protection and efficient data broadcasting (opens in a new tab)