The design and performance of distributed LT codes

Srinath Puducheri, Jörg Kliewer, Thomas E. Fuja

Research output: Contribution to journalArticlepeer-review

92 Scopus citations

Abstract

This paper describes techniques to decompose LT codes (a class of rateless erasure-correcting codes) into distributed LT (DLT) codes. DLT codes can be used to independently encode data from multiple sources in a network in such a way that, when the DLT-encoded packets are combined at a common relay, the resulting bit stream (called a modified LT (MLT) code) has a degree distribution approximating that of an LT code, with simulations indicating comparable performance. In essence, DLT codes are designed so that the final stage of encoding for erasure correction can be carried out by a low-complexity relay that selectively XORs the bit streams generated at each source and transmits the result to the sink. This paper presents results for two-source and four-source networks. It is shown that, when the relay-to-sink link is the bottleneck, the DLT/ MLT approach can yield substantial performance benefits compared with a competing strategy wherein each of the sources uses its own independent LT encoder and the resulting bit streams are time-multiplexed through the relay.

Original languageEnglish (US)
Pages (from-to)3740-3754
Number of pages15
JournalIEEE Transactions on Information Theory
Volume53
Issue number10
DOIs
StatePublished - Oct 2007
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Keywords

  • Distributed coding
  • Erasure correction
  • LT codes
  • Relay networks

Fingerprint Dive into the research topics of 'The design and performance of distributed LT codes'. Together they form a unique fingerprint.

Cite this