Sciweavers

800 search results - page 71 / 160
» On the Complexity of Parity Games
Sort
View
DATE
2009
IEEE
134views Hardware» more  DATE 2009»
14 years 4 months ago
A diagnosis algorithm for extreme space compaction
— During volume testing, test application time, test data volume and high performance automatic test equipment (ATE) are the major cost factors. Embedded testing including builti...
Stefan Holst, Hans-Joachim Wunderlich
ASPDAC
2004
ACM
109views Hardware» more  ASPDAC 2004»
14 years 2 months ago
Design methodology for IRA codes
Channel coding is an important building block in communication systems since it ensures the quality of service. Irregular repeat-accumulate (IRA) codes belong to the class of Low-...
Frank Kienle, Norbert Wehn
FOCS
1998
IEEE
14 years 1 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 9 months ago
Dirty Paper Coding using Sign-bit Shaping and LDPC Codes
Dirty paper coding (DPC) refers to methods for pre-subtraction of known interference at the transmitter of a multiuser communication system. There are numerous applications for DPC...
G. Shilpa, Andrew Thangaraj, Srikrishna Bhashyam
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 6 months ago
NLHB : A Non-Linear Hopper Blum Protocol
The Hopper-Blum (HB) protocol, which uses noised linear parities of a shared key for authentication, has been proposed for light-weight applications such as RFID. Recently, algorit...
Mukundan Madhavan, Andrew Thangaraj, Yogesh Sankar...