Tornado code: Difference between revisions

Revision as of 12:26, 1 June 2009

Revision as of 12:30, 1 June 2009

Line 1:

In [[computer science]], '''tornado codes''' are a class of [[erasure codes]] that support [[error correction]] and have fast encoding and decoding algorithms. Software-based implementations of tornado codes are about 100 times faster on small lengths and about 10,000 times faster on larger lengths than software-based [[Reed-Solomon]] erasure codes while having only slightly worse overhead.<ref>A digital fountain approach to reliable distribution of bulk data. http://portal.acm.org/citation.cfm?id=285243.285258</ref>

Tornado codes are fixed rate, near optimal erasure correcting codes that use sparse bipartite graphs to trade encoding and decoding speed for reception overhead. Since the introduction of Tornado codes, many other similar codes[[erasure code]]s have emerged, most notably [[Online codes]], [[LT codes]] and [[Raptor codes]].

== Rough overview ==

Line 36:

"Message Encoding and Transmission System and Method for Multilevel Data Redundancy", Andres Albanese, Michael Luby, Johannes Blomer and Je Edmonds, U.S. Patent No. 5,617,541, Issued April 1, 1997. Serial Number 08/361,802; 12-21-94, Assignment recorded February 27, 1995, Reel 7364, Frames 685-689.

<references/>

[[Category:Coding theory]]