Sciweavers

17 search results - page 1 / 4
» From Rateless to Hopless
Sort
View
CORR
2008
Springer
113views Education» more  CORR 2008»
13 years 11 months ago
Rateless Coding for MIMO Block Fading Channels
In this paper the performance limits and design principles of rateless codes over fading channels are studied. The diversity-multiplexing tradeoff (DMT) is used to analyze the syst...
Yijia Fan, Lifeng Lai, Elza Erkip, H. Vincent Poor
TWC
2010
13 years 5 months ago
Rateless coding for MIMO fading channels: performance limits and code construction
In this letter the performance limits and design principles of rateless codes over fading channels are studied. The diversity-multiplexing tradeoff (DMT) is used to analyze the sys...
Yijia Fan, Lifeng Lai, Elza Erkip, H. Vincent Poor
GLOBECOM
2008
IEEE
14 years 5 months ago
Queued Cooperative Wireless Networks With Rateless Codes
—Cooperative communication using rateless codes, in which the source transmits an infinite number of parity bits to the destination until the receipt of an acknowledgment, has r...
Neelesh B. Mehta, Vinod Sharma, Gaurav Bansal
ICMCS
2006
IEEE
124views Multimedia» more  ICMCS 2006»
14 years 4 months ago
Streaming of Scalable Video from Multiple Servers using Rateless Codes
This paper presents a framework for efficiently streaming scalable video from multiple servers over heterogeneous network paths. We propose to use rateless codes, or Fountain cod...
Jean-Paul Wagner, Jacob Chakareski, Pascal Frossar...
CORR
2006
Springer
99views Education» more  CORR 2006»
13 years 11 months ago
Intermediate Performance of Rateless Codes
Abstract-- Fountain codes are designed so that all input symbols can be recovered from a slightly larger number of coded symbols, with high probability using an iterative decoder. ...
Sujay Sanghavi