Results 161 to 170 of about 2,319 (194)

Systematic binary deterministic rateless codes

2008 IEEE International Symposium on Information Theory, 2008
We investigate a systematic construction of binary deterministic rateless codes (BDRCs). The codes are for networks with erasure channels. With a maximum distance separable (MDS) property, non-systematic BDRCs were first proposed in [1] with encoding complexity O(K), and decoding complexity is O(K2). Here K is the length of information bits.
null Ming Xiao, Tor Aulin, Muriel Medard
openaire   +1 more source

Rateless Codes With Unequal Error Protection Property

IEEE Transactions on Information Theory, 2007
In this correspondence, a generalization of rateless codes is proposed. The proposed codes provide unequal error protection (UEP). The asymptotic properties of these codes under the iterative decoding are investigated. Moreover, upper and lower bounds on maximum-likelihood (ML) decoding error probabilities of finite-length LT and Raptor codes for both ...
Nazanin Rahnavard, Badri N. Vellambi, Faramarz Fekri   +2 more
openaire   +2 more sources

User cooperation via rateless coding

2012 IEEE Global Communications Conference (GLOBECOM), 2012
This paper presents a new rateless coded cooperation (CC) scheme for the two-user cooperative multiple access channel (CMAC), where two users cooperatively communicate with a common destination. We consider two rateless CC strategies, a fully coded cooperation (FCC) scheme used in the conventional rateless cooperative schemes and a new partially coded ...
Mahyar Shirvanimoghaddam, Yonghui Li, Branka Vucetic   +2 more
openaire   +1 more source

An optimal partial decoding algorithm for rateless codes

2011 IEEE International Symposium on Information Theory Proceedings, 2011
Rateless codes are designed to decode all the input symbols when a certain number of coded symbols have been received. However, it is possible to recover a subset of the input symbols from the actually received coded symbols: this process is called partial decoding and the number of recovered input symbols is termed the intermediate performance of ...
BIOGLIO, Valerio, GRANGETTO, Marco, GAETA, Rossano, SERENO, Matteo   +3 more
openaire   +1 more source

Rateless Codes and Big Downloads

2003
This paper presents a novel algorithm for downloading big files from multiple sources in peer-to-peer networks. The algorithm is simple, but offers several compelling properties. It ensures low hand-shaking overhead between peers that download files (or parts of files) from each other.
Petar Maymounkov, David Mazières
openaire   +1 more source

Cooperative rateless codes for NGB-W

10th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM 2014), 2014
The properties of rateless codes make it very suitable for all types of broadcast systems. In this paper, the rateless codes are adopted in the Next Generation Broadcast Network Wireless (NGB-W) system and two cooperative rateless codes are proposed for two different scenarios in NGB-W system.
null Hong Tang, null Jianing Zhao, null Yujiao He, null Lijuan Tao   +3 more
openaire   +1 more source

Novel performance indices of rateless codes

2013 22nd Wireless and Optical Communication Conference, 2013
This paper analyses the precondition, applicable occasions, advantages and drawbacks of several rateless codes performance indices. And then presents the ideal rateless code model. After that, we introduce several novel indices such as average delay, maximum memory consumption and uniformity recovery entropy according to the proposed model.
Yunji Li, Xiaolong Yang, Keping Long
openaire   +1 more source

Accumulate rateless codes for AWGN channel

2008 Third International Conference on Communications and Networking in China, 2008
We think about the problem of reliable transmission of information over AWGN channels using rateless codes. We introduce a new family of rateless codes, named the accumulate rateless (AR) codes, which is easy to construct as traditional LT codes but has better performance and lower complexity.
null Kedi Wu, null Zhaoyang Zhang, null Yuanyuan Huo, null Shengtian Yang   +3 more
openaire   +1 more source

Exploiting Rateless Coding for Massive Access

IEEE Transactions on Vehicular Technology, 2018
In this correspondence paper, we design a massive nonorthogonal multiple access (NOMA) scheme with delay provisioning for cellular internet-of-things. In the context of massive access, the severe interuser interference decreases the quality of the received signal, such that it is a nontrivial task to provide a delay provisioning for heterogeneous ...
Xiaoming Chen, Rundong Jia
openaire   +1 more source

Adaptive rateless coding under partial information

2008 Information Theory and Applications Workshop, 2008
We present novel rateless codes that generalize and outperform LT codes (with respect to overall communication and computation complexity) when some input symbols are already available at the decoding host. This case can occur in data synchronization scenarios, or where feedback is provided or can be inferred from transmission channel models.
Sachin Agarwal, Andrew Hagedorn, Ari Trachtenberg   +2 more
openaire   +1 more source