In this paper we analyze a specific class of rateless codes, called LT codes with unequal recovery time. These codes provide the option of prioritizing different segments of the transmitted data over other. The result is that segments are decoded in stages during the rateless transmission, where higher prioritized segments are decoded at lower overhead. Our analysis focuses on quantifying the e...

By performing the encoding operation on several message packets, rateless coding in cooperative networks has the potential risk of processing information already available to the receivers. In this paper, the intermediate packet decodability of rateless codes is exploited to mitigate such redundant packet processing at the cooperating nodes. The message packets that are already decoded at the r...

A rateless transmission architecture is developed for communication over Gaussian intersymbol interference channels, based on the concept of super-Nyquist (SNQ) signaling. In such systems, the signaling rate is chosen significantly higher than the Nyquist rate of the system. We show that such signaling, when used in conjunction with good “off-the-shelf” base codes, simple linear redundancy, and...

We study the multicast authentication problem when an opponent can drop, reorder and introduce data packets into the communication channel. We first study the packet authentication probability of a scheme proposed by Lysyanskaya, Tamassia and Triandopoulos in 2003 since our opponent model is based on theirs. Using a family of rateless codes called Luby Transform codes (LT codes) we design a pro...

Performance of data recovery is important for network coding in wireless sensor networks. The newly proposed ‘packet-centric’ distributed rateless coding strategies present fairly good performance close to that of the optimized centralized rateless codes. Nevertheless, such strategies may waste a lot of computation and energy resources, because many coded packets may visit the sensor nodes repe...

In this paper, we propose a new ensemble of rateless forward error correction (FEC) codes. The proposed codes are serially concatenated codes with Reed-Solomon (RS) codes as outer codes and Kite codes as inner codes. The inner Kite codes are a special class of prefix rateless low-density paritycheck (PRLDPC) codes, which can generate potentially infinite (or as many as required) random-like par...

We study codes for the AWGN channel. We build upon the recently proposed sparse superposition codes of Barron and Joseph, which for any constant backoff from capacity can achieve exponential error probability with polynomial decoding time as long as the block-length is greater than a fixed constant (which depends on the backoff). Our contribution is twofold: • First, we give a variant of the co...