314 search results - page 42 / 63 » A Comparison of Known Codes, Random Codes, and the Best Code... |
VTC
2006
IEEE
14 years 1 months ago
2006
IEEE
— The impact of communications signal processing such as QAM modulations (instead of gaussian signals), finite block lengths (instead of infinitely long codes), and using simpl...
TIT
2008
13 years 7 months ago
2008
We consider the problem of sequential decision making for random fields corrupted by noise. In this scenario, the decision maker observes a noisy version of the data, yet judged wi...
ISCC
2003
IEEE
14 years 23 days ago
2003
IEEE
— We consider a network of n sender/receiver pairs, placed randomly in a region of unit area. Network capacity, or maximum throughput, is defined as the highest rate that can be...
TCC
2009
Springer
14 years 8 months ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract.1 The scheme of the sliding window is known in Information Theory, Computer Science, the problem of predicting and in stastistics. Let a source with unknown statistics gen...