New reliable error-detection codes with fast implementations

Gam D. Nguyen · 2002

This paper presents a technique for constructing a new class of reliable codes that have efficient software and hardware implementations as well as flexible design parameters such as usable codeword lengths and error-detecting capability. Furthermore, in contrast to the slow bitwise procedure often used for the cyclical redundancy codes, the new codes are bytewise-oriented; hence, they are more easily implemented in modern computers and networks.

Read the paper · More papers on PaperTik