Sciweavers

181 search results - page 32 / 37
» On the Number of Errors Correctable with Codes on Graphs
Sort
View
MICRO
2006
IEEE
159views Hardware» more  MICRO 2006»
13 years 6 months ago
MRF Reinforcer: A Probabilistic Element for Space Redundancy in Nanoscale Circuits
Shrinking devices to the nanoscale, increasing integration densities, and reducing of voltage levels down to the thermal limit, all conspire to produce faulty systems. Frequent oc...
Kundan Nepal, R. Iris Bahar, Joseph L. Mundy, Will...
POPL
1989
ACM
13 years 10 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
ICC
2007
IEEE
146views Communications» more  ICC 2007»
14 years 1 months ago
Optimally Mapping an Iterative Channel Decoding Algorithm to a Wireless Sensor Network
–Retransmission based schemes are not suitable for energy constrained wireless sensor networks. Hence, there is an interest in including parity bits in each packet for error cont...
Saad B. Qaisar, Shirish S. Karande, Kiran Misra, H...
JSAC
2010
142views more  JSAC 2010»
13 years 5 months ago
Extreme value FEC for reliable broadcasting in wireless networks
—The advent of practical rateless codes enables implementation of highly efficient packet-level forward error correction (FEC) strategies for reliable data broadcasting in loss-...
Weiyao Xiao, David Starobinski
TIT
2002
126views more  TIT 2002»
13 years 6 months ago
Two-dimensional interleaving schemes with repetitions: Constructions and bounds
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
Tuvi Etzion, Alexander Vardy