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 28 for “"Rateless codes"”.
-
Efficient decoding and application of rateless codes
Fountain codes have recently gained wide attention in the communications research community due to their capacity-approaching performance and rateless properties that allow them to seamlessly adapt to unknown channel statistics. This thesis of fers two key contributions. For the first, we consider …
-
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 …
-
On feedback-based rateless codes for data collection in vehicular networks
… communication schemes built upon feedback-based rateless codes, and with a target application of vehicular networks. In particular, we first investigate the feasibility of multi-hop networking for intra-car WSN, and illustrate the potential gains of using the Collection Tree Protocol (CTP), the …
-
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 …
-
Rateless coding over wireless channels: Theory, design and applications
In this work we investigate rateless coding and modulation for wireless communication systems. In particular we are interested in channels in which only the transmitter has channel knowledge. For this setting, we show that rateless codes have properties that make them well suited for wireless …
-
Optimization of Rateless Coded Systems for Wireless Mulitmedia Multicast
Rateless codes, also known as fountain codes, are a class of erasure error-control codes that are particularly well suited for broadcast/multicast systems. Raptor codes, as a particularly successful implementation of digital fountain codes, have been used as the application layer forward error …
-
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 …
-
Reduced-complexity decoding of fountain codes
Fountain codes are a universal class of rateless codes originally designed for erasure channels. Naturally adapting to channel states without channel knowledge at the transmitter, Fountain codes have recently been demonstrated also as an appealing solution for communication over fading channels. …
-
Modern Error Control Codes and Applications to Distributed Source Coding
… first studies two-dimensional wavelet codes (TDWCs). TDWCs are introduced as a solution to the problem of designing a 2-D code that has low decoding- complexity and has the maximum erasure-correcting property for rectangular burst erasures. The half-rate TDWCs of dimensions …
-
Byzantine-tolerant erasure coding for blockchains
… Aurora utilizes Maximum Distance Separable (MDS) codes paired with vector commitments like KZG, optimizing for robust data redundancy and secure verification processes. Phoenix, conversely, leverages rateless codes alongside homomorphic commitments, offering greater flexibility and efficiency in …
-
Near-capacity fixed-rate and rateless channel code constructions
Fixed-rate and rateless channel code constructions are designed for satisfying conflicting design tradeoffs, leading to codes that benefit from practical implementations, whilst offering a good bit error ratio (BER) and block error ratio (BLER) performance. More explicitly, two novel low-density …
-
Analysis and design of peer-to-peer video on-demand streaming
… caching scheme and a transport protocol based on rateless codes. Notions of production and saturation time, naturally arising in this context, are introduced to characterize the dynamics and performance of the P2P streaming system. Quantified in terms of production, the throughput of the presented …
-
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 …
-
Modeling and analysis of the performance of collaborative wireless ad-hoc networks: an information-theoretic perspective
… coding, such as the application of packet-level rateless codes, on the latency, reliability, and energy efficiency of the network. These codes provide us the means to break large messages into smaller packets thereby enabling efficient communication. The work then focuses on developing and …
-
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 …
-
Optimization of Rateless Code Based Video Multicast
… networks has gained a lot of interest. Raptor codes, with linear encoding and decoding time complexity are one branch of fountain codes (also known as rateless codes) which have found their ways in many recent communication standards as application layer forward error correcting (FEC) codes. …
-
Outage Capacity and Code Design for Dying Channels
… to a random fatal failure. We consider the rateless codes and optimize the degree distribution to maximize the average recovery probability. In particular, we first study the upper bound of the average recovery probability, based on which we define the objective function as the gap between …
-
Techniques for improving predictability and message efficiency of gossip protocols
… the problem of message overhead, we present Rateless Gossip. Rateless Gossip leverages gossip with Rateless Codes to reduce the message overhead substantially. Compared to tree-based deterministic protocol which requires O(N) transmissions to disseminate a message to a group of N nodes, …
-
Applications of graph-based codes in networks: analysis of capacity and design of improved algorithms
The conception of turbo codes by Berrou et al. has created a renewed interest in modern graph-based codes. Several encouraging results that have come to light since then have fortified the role these codes shall play as potential solutions for present and future communication problems. This work …
Page 1 of 2