Explicit Codes Achieving List Decoding Capacity: Error-correction with Optimal Redundancy∗ Venkatesan Guruswami1† Atri Rudra2‡

First Page		Document Content
Date: 2008-04-23 08:55:33 Theoretical computer science Information List decoding Reed–Solomon error correction Concatenated error correction code Forward error correction Noisy-channel coding theorem Venkatesan Guruswami Code Coding theory Error detection and correction Mathematics		Explicit Codes Achieving List Decoding Capacity: Error-correction with Optimal Redundancy∗ Venkatesan Guruswami1† Atri Rudra2‡ Add to Reading List Source URL: www.cs.cmu.edu Download Document from Source Website File Size: 403,81 KB Share Document on Facebook

	ATP TCP Reducing the Latency-Tail of Short-Lived Flows: Adding Forward Error Correction in Data Centers DocID: 1t0Hs - View Document
	Reducing the Latency-Tail of Short-Lived Flows: Adding Forward Error Correction in Data Centers Klaus-Tycho Foerster, Demian Jaeger, David Stolz, and Roger Wattenhofer ETH Zurich, Switzerland {foklaus, jaegerde, stolzda, DocID: 1sXLX - View Document
	How to Calculate P(O) Calculating P(O) Forward Algorithm Backward Algorithm DocID: 1rsaS - View Document
	Decoupling RPCs from Forward-Error Correction in Virtual Machines Ike Antkaretoo International Institute of Technology United Slates of Earth DocID: 1rmL1 - View Document
	PROBABILISTIC ALGORITHM FOR LIST VITERBI DECODING by Janani Kalyanam DocID: 1rlYO - View Document