Sciweavers

63 search results - page 3 / 13
» Optimal Error Correction Against Computationally Bounded Noi...
Sort
View
TIT
2008
110views more  TIT 2008»
13 years 5 months ago
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
Venkatesan Guruswami, Atri Rudra
ICPR
2008
IEEE
14 years 6 months ago
On using error bounds to optimize cost-sensitive multimodal biometric authentication
While using more biometric traits in multimodal biometric fusion can effectively increase the system robustness, often, the cost associated to adding additional systems is not con...
Norman Poh, Josef Kittler
DCC
2010
IEEE
14 years 3 days ago
On Computation of Performance Bounds of Optimal Index Assignment
Channel-optimized index assignment of source codewords is arguably the simplest way of improving transmission error resilience, while keeping the source and/or channel codes intac...
Xiaolin Wu, Hans D. Mittelmann, Xiaohan Wang, Jia ...
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
13 years 9 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or

Publication
545views
14 years 2 months ago
Reid et al.'s Distance Bounding Protocol and Mafia Fraud Attacks over Noisy Channels
Distance bounding protocols are an effective countermeasure against relay attacks including distance fraud, mafia fraud and terrorist fraud attacks. Reid et al. proposed the first ...
A. Mitrokotsa, C. Dimitrakakis, P. Peris-Lopez, J....