Sciweavers

4 search results - page 1 / 1
» Cyclic Redundancy Code (CRC) Polynomial Selection For Embedd...
Sort
View
DSN
2004
IEEE
13 years 8 months ago
Cyclic Redundancy Code (CRC) Polynomial Selection For Embedded Networks
Cyclic Redundancy Codes (CRCs) provide a first line of defense against data corruption in many networks. Unfortunately, many commonly used CRC polynomials provide significantly le...
Philip Koopman, Tridib Chakravarty
DSN
2006
IEEE
13 years 8 months ago
Efficient High Hamming Distance CRCs for Embedded Networks
Cyclic redundancy codes (CRCs) are widely used in network transmission and data storage applications because they provide better error detection than lighter weight checksum techn...
Justin Ray, Philip Koopman
DSN
2002
IEEE
13 years 9 months ago
32-Bit Cyclic Redundancy Codes for Internet Applications
Standardized 32-bit Cyclic Redundancy Codes provide fewer bits of guaranteed error detection than they could, achieving a Hamming Distance (HD) of only 4 for maximum-length Ethern...
Philip Koopman
ACNS
2004
Springer
247views Cryptology» more  ACNS 2004»
13 years 10 months ago
Low-Latency Cryptographic Protection for SCADA Communications
Abstract. Supervisory Control And Data Acquisition (SCADA) systems are real-time process control systems that are widely deployed throughout critical infrastructure sectors includi...
Andrew K. Wright, John A. Kinast, Joe McCarty