Sciweavers

2655 search results - page 4 / 531
» LT Network Codes
Sort
View
ICALP
1993
Springer
13 years 11 months ago
Sparse Networks Supporting Efficient Reliable Broadcasting
Broadcasting concerns transmitting information from a node of a communication network to all other nodes. We consider this problem assuming that links and nodes of the network fail...
Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
SSS
2010
Springer
160views Control Systems» more  SSS 2010»
13 years 4 months ago
A Comparative Study of Rateless Codes for P2P Persistent Storage
Abstract. This paper evaluates the performance of two seminal rateless erasure codes, LT Codes and Online Codes. Their properties make them appropriate for coping with communicatio...
Heverson Borba Ribeiro, Emmanuelle Anceaume
VTC
2007
IEEE
130views Communications» more  VTC 2007»
14 years 1 months ago
Amalgamated Generalized Low Density Parity Check and Luby Transform Codes for the Wireless Internet
– Luby Transform codes (LT) were originally designed for the Binary Erasure Channel (BEC) encountered owing to randomly dropped packets in the statistical multiplexing aided Inte...
Thanh Dang Nguyen, Fang-Chun Kuo, Lie-Liang Yang, ...
INFOCOM
2007
IEEE
14 years 1 months ago
Many-to-Many Communication: A New Approach for Collaboration in MANETs
—We introduce a collaboration-driven approach to the sharing of the available bandwidth in wireless ad hoc networks, which we call many-to-many cooperation, that allows concurren...
Renato M. de Moraes, Hamid R. Sadjadpour, J. J. Ga...
SODA
2008
ACM
95views Algorithms» more  SODA 2008»
13 years 8 months ago
Concatenated codes can achieve list-decoding capacity
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra