Sciweavers

872 search results - page 131 / 175
» Extreme lower probabilities
Sort
View
CORR
2006
Springer
96views Education» more  CORR 2006»
14 years 12 months ago
Upper Bounding the Performance of Arbitrary Finite LDPC Codes on Binary Erasure Channels
Assuming iterative decoding for binary erasure channels (BECs), a novel tree-based technique for upper bounding the bit error rates (BERs) of arbitrary, finite low-density parity-c...
Chih-Chun Wang, Sanjeev R. Kulkarni, H. Vincent Po...
ISCI
2008
137views more  ISCI 2008»
14 years 11 months ago
Stochastic dominance-based rough set model for ordinal classification
In order to discover interesting patterns and dependencies in data, an approach based on rough set theory can be used. In particular, Dominance-based Rough Set Approach (DRSA) has...
Wojciech Kotlowski, Krzysztof Dembczynski, Salvato...
CORR
2007
Springer
95views Education» more  CORR 2007»
14 years 11 months ago
A Note on the Periodicity and the Output Rate of Bit Search Type Generators
We investigate the bit-search type irregular decimation algorithms that are used within LFSR-based stream ciphers. In particular, we concentrate on BSG and ABSG, and consider two ...
Yucel Altug, N. Polat Ayerden, Mehmet Kivanç...
CORR
2007
Springer
101views Education» more  CORR 2007»
14 years 11 months ago
On The Limitations of The Naive Lattice Decoding
In this paper, the inherent drawbacks of the naive lattice decoding for MIMO fading systems is investigated. We show that using the naive lattice decoding for MIMO systems has con...
Mahmoud Taherzadeh, Amir K. Khandani
DM
2007
83views more  DM 2007»
14 years 11 months ago
Codes identifying sets of vertices in random networks
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1, ≤ ℓ)-identifying codes. These codes enable us to detect sets of faulty processor...
Alan M. Frieze, Ryan Martin, Julien Moncel, Mikl&o...