Error-detection codes: algorithms and fast implementation

Binary CRCs are very effective for error detection, but their software implementation is not very efficient. Thus, many binary nonCRC codes (which are not as strong as CRCs, but can be more efficiently implemented in software) are proposed as alternatives to CRCs. The nonCRC codes include WSC, CXOR,...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on computers Vol. 54; no. 1; pp. 1 - 11
Main Author Nguyen, G.D.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.01.2005
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Algorithms
Block codes
Blocking
checksum
Complexity theory
Computer programs
Construction
CRC
Error detection
Error detection coding
Hamming code
Hamming codes
Index Terms- Fast error-detection code
Linear codes
Message passing
Nonlinearity
Polynomials
Software
Online AccessGet full text
ISSN0018-9340
1557-9956
DOI10.1109/TC.2005.7

Cover

More Information
Summary:Binary CRCs are very effective for error detection, but their software implementation is not very efficient. Thus, many binary nonCRC codes (which are not as strong as CRCs, but can be more efficiently implemented in software) are proposed as alternatives to CRCs. The nonCRC codes include WSC, CXOR, one's-complement checksum, Fletcher checksum, and block-parity code. We present a general algorithm for constructing a family of binary error-detection codes. This family is large because it contains all these nonCRC codes, CRCs, perfect codes, as well as other linear and nonlinear codes. In addition to unifying these apparently disparate codes, our algorithm also generates some nonCRC codes that have minimum distance 4 (like CRCs) and efficient software implementation.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.2005.7