Sciweavers

3852 search results - page 201 / 771
» Construction of Codes for Network Coding
Sort
View
DSN
2005
IEEE
15 years 10 months ago
Coverage and the Use of Cyclic Redundancy Codes in Ultra-Dependable Systems
A Cyclic Redundancy Code (CRC), when used properly, can be an effective and relatively inexpensive method to detect data corruption across communication channels. However, some sy...
Michael Paulitsch, Jennifer Morris, Brendan Hall, ...
STOC
1994
ACM
134views Algorithms» more  STOC 1994»
15 years 8 months ago
A coding theorem for distributed computation
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
Sridhar Rajagopalan, Leonard J. Schulman
APN
2006
Springer
15 years 6 months ago
Invariant Based Programming
Program verification is usually done by adding specifications and invariants to the program and then proving that the verification conditions are all true. This makes program verif...
Ralph-Johan Back
ICC
2007
IEEE
15 years 10 months ago
Using Session-Keystroke Mutual Information to Detect Self-Propagating Malicious Codes
— In this paper, we propose an endpoint-based joint network-host anomaly detection technique to detect selfpropagating malicious codes. Our proposed technique is based on the obs...
Syed A. Khayam, Hayder Radha
JSYML
2008
109views more  JSYML 2008»
15 years 4 months ago
Closed fragments of provability logics of constructive theories
In this paper we give a new proof of the characterization of the closed fragment of the provability logic of Heyting's Arithmetic. We also provide a characterization of the c...
Albert Visser