39 search results - page 4 / 8 » Error exponents of expander codes |
FOCS
1994
IEEE
13 years 11 months ago
1994
IEEE
Sipser and Spielman have introduced a constructive family of asymptotically good linear error-correcting codes--expander codes--together with a simple parallel algorithm that will ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Distributed source coding is traditionally viewed in the block coding context -- all the source symbols are known in advance at the encoders. This paper instead considers a stream...
COCO
2007
Springer
14 years 1 months ago
2007
Springer
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
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...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
The multi-layer bit-wise unequal error protection problem is considered for variable length block codes with feedback. Inner and outer bounds are derived for achievable performanc...