Sciweavers

752 search results - page 2 / 151
» Coding for Errors and Erasures in Random Network Coding
Sort
View
DSN
2007
IEEE
13 years 8 months ago
Determining Fault Tolerance of XOR-Based Erasure Codes Efficiently
We propose a new fault tolerance metric for XOR-based erasure codes: the minimal erasures list (MEL). A minimal erasure is a set of erasures that leads to irrecoverable data loss ...
Jay J. Wylie, Ram Swaminathan
CORR
2008
Springer
115views Education» more  CORR 2008»
13 years 4 months ago
Coding over an Erasure Channel with a Large Alphabet Size
An erasure channel with a fixed alphabet size q, where q 1, is studied . It is proved that over any erasure channel (with or without memory), Maximum Distance Separable (MDS) codes...
Shervan Fashandi, Shahab Oveis Gharan, Amir K. Kha...
INFOCOM
2010
IEEE
13 years 3 months ago
Compressive Oversampling for Robust Data Transmission in Sensor Networks
—Data loss in wireless sensing applications is inevitable and while there have been many attempts at coping with this issue, recent developments in the area of Compressive Sensin...
Zainul Charbiwala, Supriyo Chakraborty, Sadaf Zahe...
SIGCOMM
1990
ACM
13 years 8 months ago
Reliable Broadband Communication Using a Burst Erasure Correcting Code
Traditionally, a transport protocol corrects errors in a computer communication network using a simple ARQ protocol. With the arrival of broadband networks, forward error correcti...
Anthony J. McAuley
CORR
2007
Springer
115views Education» more  CORR 2007»
13 years 4 months ago
Error Exponents of Erasure/List Decoding Revisited via Moments of Distance Enumerators
The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen’s inequality as well as some other inequa...
Neri Merhav