In this paper, we propose a novel distributed unequal error protection (UEP) rateless coding scheme (DURC) for space information networks (SIN). We consider the multimedia data transmissions in a dual-hop SIN communication scenario, where multiple disjoint source nodes need to transmit their UEP rateless coded data to a destination via a dynamic relay. We formulate the optimization problems to ...

This paper presents a proof of the existence of computationally fast probabilistic erasure codes at distance ǫ from being MDS, namely the decoding algorithm is able with high probability to reconstruct the n letter message from any set of (1+ǫ)n letters. It can either be fixed rate or a rateless LT code [10] in that any number of code letters can be produced and each is produced independently o...

in this paper, we consider a class of column-weight two quasi-cyclic low-density paritycheck codes in which the girth can be large enough, as an arbitrary multiple of 8. then we devote a convolutional form to these codes, such that their generator matrix can be obtained by elementary row and column operations on the parity-check matrix. finally, we show that the free distance of the convolution...

This paper considers the problem of transferring a file from one source node to multiple receivers in a peer-to-peer (P2P) network. The objective is to minimize the weighted sum delay (WSD) for the one-to-many file transfer where peers have both uplink and downlink bandwidth constraints specified. The static scenario is a file-transfer scheme in which the network resource allocation remains sta...

This paper aims at designing a selective demodulation scheme based on Log-likelihood Ratio threshold (SDLT) instead of the conventional adaptive demodulation (ADM) scheme, by using rateless codes. The major difference is that the Log-likelihood ratio (LLR) threshold is identified as a key factor to control the demodulation rate, while the ADM uses decision region set (DRS) to adjust the bit rat...