Sciweavers

181 search results - page 21 / 37
» On the Number of Errors Correctable with Codes on Graphs
Sort
View
COCO
2007
Springer
96views Algorithms» more  COCO 2007»
14 years 27 days ago
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
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 ...
Venkatesan Guruswami, Christopher Umans, Salil P. ...
DCC
2005
IEEE
14 years 6 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
ECEASST
2010
13 years 4 months ago
GUI Inspection from Source Code Analysis
Abstract: Graphical user interfaces (GUIs) are critical components of todays software. Given their increased relevance, correctness and usability of GUIs are becoming essential. Th...
João Carlos Silva 0002, José Creissa...
ICIP
1999
IEEE
14 years 8 months ago
Generalized Multiple Description Coding Through Unequal Loss Protection
We use unequal amounts of explicit channel coding for generalized multiple description coding. Our solution can use any progressive source coder and it disperses information equal...
Alexander E. Mohr, Richard E. Ladner, Eve A. Riski...
ISCAS
2005
IEEE
167views Hardware» more  ISCAS 2005»
14 years 10 days ago
Low-power log-MAP turbo decoding based on reduced metric memory access
Due to the powerful error correcting performance, turbo codes have been adopted in many wireless communication standards. Although several low-power techniques have been proposed,...
Dong-Soo Lee, In-Cheol Park