1259 search results - page 14 / 252 » In search of the memoryless property |
SIAMDM
2008
14 years 9 months ago
2008
Ensembles of regular low-density parity-check codes over any finite Abelian group G are studied. The nonzero entries of the parity matrix are randomly chosen, independently and uni...
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
The parity acceptance condition for -regular languages is a special case of the Rabin and Streett acceptance conditions. While the parity acceptance condition is as expressive as ...
GLOBECOM
2010
IEEE
14 years 7 months ago
2010
IEEE
1 Shannon's channel capacity specifies the upper bound on the amount of bits per channel use. In this paper, we explicitly demonstrate that twin-component turbo codes suffer f...
SIAMCO
2010
14 years 4 months ago
2010
This work is concerned with identification of Hammerstein systems whose outputs are measured by quantized sensors. The system consists of a memoryless nonlinearity that is polynomi...
110
click to vote
EDBT
2012
ACM
13 years 4 days ago
2012
ACM
Conventional research on similarity search focuses on measuring the similarity between objects with the same type. However, in many real-world applications, we need to measure the...