Sciweavers

11 search results - page 1 / 3
» 32-Bit Cyclic Redundancy Codes for Internet Applications
Sort
View
DSN
2002
IEEE
13 years 11 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
DSN
2006
IEEE
13 years 10 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
2004
IEEE
13 years 10 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
ICIP
2003
IEEE
14 years 8 months ago
Product code error protection of packetized multimedia bitstreams
Sherwood and Zeger proposed a source-channel coding system where the source code is an embedded bitstream and the channel code is a product code such that each row code is a conca...
Vladimir Stankovic, Raouf Hamzaoui, Zixiang Xiong
CORR
2010
Springer
261views Education» more  CORR 2010»
13 years 4 months ago
Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel
In this paper, we show that over the binary erasure channel, Quasi-Cyclic LDPC codes can efficiently accommodate the hybrid iterative/ML decoding. We demonstrate that the quasicycl...
Mathieu Cunche, Valentin Savin, Vincent Roca