Sciweavers

752 search results - page 5 / 151
» Coding for Errors and Erasures in Random Network Coding
Sort
View
STOC
1998
ACM
139views Algorithms» more  STOC 1998»
13 years 10 months ago
Analysis of Low Density Codes and Improved Designs Using Irregular Graphs
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
VTC
2007
IEEE
130views Communications» more  VTC 2007»
14 years 16 days 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, ...
TIT
2008
73views more  TIT 2008»
13 years 6 months ago
Turbo Codes in Binary Erasure Channel
In this correspondence, the stopping set of turbo codes with iterative decoding in the binary erasure channel is defined. Block and bit erasure probabilities of turbo codes are stu...
Jeong Woo Lee, Rüdiger L. Urbanke, Richard E....
DCC
2002
IEEE
14 years 5 months ago
Globally Optimal Uneven Error-Protected Packetization of Scalable Code Streams
In this paper, we present a family of new algorithms for rate-fidelity optimal packetization of scalable source bit streams with uneven error protection. In the most general settin...
Sorina Dumitrescu, Xiaolin Wu, Zhe Wang
ADHOCNETS
2009
Springer
14 years 27 days ago
Error Correction with the Implicit Encoding Capability of Random Network Coding
—We introduce a novel error correction scheme that uses the implicit encoding capability of Random Network Coding. This scheme does not add redundancy to the data prior to transm...
Suné von Solms, Magdalena J. Grobler, Alber...