1282 search results - page 26 / 257 » Practical Loss-Resilient Codes |
149
click to vote
DCC
2005
IEEE
15 years 7 months ago
2005
IEEE
We derive an upper bound on the average MAP decoding error probability of random linear SW codes for arbitrary correlated stationary memoryless sources defined on Galois fields....
149
click to vote
GLOBECOM
2009
IEEE
15 years 12 months ago
2009
IEEE
—In [1], we have proposed a novel cross-layer scheme based on resolution adaptive ADCs and fountain codes for the OFDM systems to lower the power consumption in ADCs. The simulat...
161
click to vote
CC
2003
Springer
15 years 10 months ago
2003
Springer
Popular mobile code architectures (Java and .NET) include verifiers to check for memory safety and other security properties. Since their formats are relatively high level, suppor...
160
click to vote
COMPSAC
2009
IEEE
15 years 8 months ago
2009
IEEE
—Many efficient random testing algorithms for object-oriented software have been proposed due to their simplicity and reasonable code coverage; however, even the stateof-the-art...
136
click to vote
DCC
2007
IEEE
15 years 5 months ago
2007
IEEE
This paper describes design of a low-complexity algorithm for adaptive encoding/decoding of binary sequences produced by memoryless sources. The algorithm implements universal blo...