Sciweavers

2655 search results - page 3 / 531
» LT Network Codes
Sort
View
COCOON
2009
Springer
14 years 1 months ago
Limits to List Decoding Random Codes
It has been known since [Zyablov and Pinsker 1982] that a random q-ary code of rate 1 − Hq(ρ) − ε (where 0 < ρ < 1 − 1/q, ε > 0 and Hq(·) is the q-ary entropy ...
Atri Rudra
SIPS
2007
IEEE
14 years 1 months ago
Systematic Luby Transform Codes and Their Soft Decoding
– Luby Transform codes (LT) were originally designed for the Binary Erasure Channel (BEC) encountered owing to randomly dropped packets in the statistical multiplexing aided clas...
Thanh Dang Nguyen, Lie-Liang Yang, Lajos Hanzo
STOC
1994
ACM
134views Algorithms» more  STOC 1994»
13 years 11 months ago
A coding theorem for distributed computation
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
Sridhar Rajagopalan, Leonard J. Schulman
ISCAS
2007
IEEE
103views Hardware» more  ISCAS 2007»
14 years 1 months ago
Sliding-Window Digital Fountain Codes for Streaming of Multimedia Contents
— Digital fountain codes are becoming increasingly important for multimedia communications over networks subject to packet erasures. These codes have significantly lower complex...
Mattia C. O. Bogino, Pasquale Cataldi, Marco Grang...
EUROCRYPT
2007
Springer
14 years 1 months ago
Secure Computation from Random Error Correcting Codes
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert...