Arrow Research search
Back to FOCS

FOCS 2002

LT Codes

Conference Paper Session 4A Algorithms and Complexity ยท Theoretical Computer Science

Abstract

We introduce LT codes, the first rateless erasure codes that are very efficient as the data length grows.

Authors

Keywords

  • Decoding
  • Tornadoes
  • Encoding
  • Aggregates
  • Costs
  • Computer science
  • Luby Transform Codes
  • Data Length
  • Scope Of This Paper
  • Constant Factor
  • Graph Structure
  • Average Degree
  • Degree Distribution
  • Identical Distribution
  • Classical Process
  • Content Delivery
  • Data Delivery
  • Random Bits
  • Reed-Solomon Codes
  • Input Symbols
  • Decoding Time

Context

Venue
IEEE Symposium on Foundations of Computer Science
Archive span
1975-2025
Indexed papers
3809
Paper id
116970457561311216
v2026.09.13