Sciweavers

91 search results - page 16 / 19
» Some Soft-Decision Decoding Algorithms for Reed-Solomon Code...
Sort
View
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 4 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
ICIW
2009
IEEE
14 years 4 months ago
Paircoding: Improving File Sharing Using Sparse Network Codes
BitTorrent and Practical Network Coding are efficient methods for sharing files in a peer-to-peer network. Both face the problem to distribute a given file using peers with dif...
Christian Ortolf, Christian Schindelhauer, Arne Va...
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
12 years 9 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin
CORR
2006
Springer
152views Education» more  CORR 2006»
13 years 9 months ago
On Reduced Complexity Soft-Output MIMO ML detection
In multiple-input multiple-output (MIMO) fading channels maximum likelihood (ML) detection is desirable to achieve high performance, but its complexity grows exponentially with th...
Massimiliano Siti, Michael P. Fitz
FPL
2008
Springer
207views Hardware» more  FPL 2008»
13 years 11 months ago
Bitstream compression techniques for Virtex 4 FPGAs
This paper examines the opportunity of using compression for accelerating the (re)configuration of FPGA devices, focusing on the choice of compression algorithms, and their hardwa...
Radu Stefan, Sorin Dan Cotofana