Random linear fountain codes were introduced in the last lecture as a sparse-graph codes for channels with erasure. It turned out that their encoding and decoding costs were quadratic and cubic in the number of packets encoded. We study Luby Transform (LT) codes in this lecture, pioneered by Michael Luby, that retains the good performance of random linear fountain code, while drastically reduci...

Recently, there has been a surge of interests, e.g., [2,3], in the design of so called “space-time” codes which take adv;antage of both the spatial diversity provided by multiple antennas and the temporal diversity available with time-varying fading. Design criteria [3-51 have been proposed for space-time codes in a variety of environments. In quasi-static Rayleigh fading channel, each possible...

The concept of Network-on-Chip (NoC) is becoming a main trend in the area of System-on-Chip (SoC) design. In NoC communications, data may have errors caused by noise or technology. Forward-Error-Correction (FEC) algorithms can be used to improve the systems’ reliability by detecting and correcting errors on the receivers. Many FEC algorithms were proposed and investigated during the past few de...

This paper introduces three coding strategies for using the Luby Transform (LT) code in a relay aided power-line communication scheme. In the first method, the relay decodes the received packets and re-encodes them for transmission towards the destination. In the second method, the relay only forwardes a random linear combination of its received packets towards the destination, while in the thi...

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...

Corresponding Author: Joe Louis Paul, I. Department of Information Technology, SSN College of Engineering, Chennai, India Email: [email protected] Abstract: Luby Transform (LT) codes, the first realization of rateless codes are widely used in wireless communication mainly for its adaptability to varying channel conditions and its capacity approaching performance. In spite of the above advant...

We report the complete DNA sequence of the Escherichia coli elt A gene, which codes for the A subunit of the heat-labile enterotoxin, LT. The amino acid sequence of the LT A subunit has been deduced from the DNA sequence of elt A. The LT A subunit starts with methionine, ends with leucine, and comprises 264 amino acids. The computed molecular weight of LT A is 29,673. The A subunit of cho...

This paper evaluates the performance of two seminal rateless erasure codes, LT Codes and Online Codes. Their properties make them appropriate for coping with communication channels having an unbounded loss rate. They are therefore very well suited to peer-to-peer systems. This evaluation targets two goals. First, it compares the performance of both codes in different adversarial environments an...

A novel approach of estimating Decoding Error-Probability (DEP) of LT codes, using the conditional Kovalenko’s Rank-Distribution, is proposed. The estimate is utilized for constructing optimal LT codes with dense rows achieving the DEP that is very close to Kovalenko’s FullRank Limit. Experimental evidences which show the viability of the estimate is also provided. INTRODUCTION AND BACKGROUNDS ...