Andreas Doering, Marcel Waldvogel
Abstract
An algorithm for software or hardware implementation is presented, allowing fast computation of cyclic redundancy checks with arbitrary polynomials and a high flexibility, such as updating of checksums after modifying data block parts with a known old checksum.
OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
An algorithm for software or hardware implementation is presented, allowing fast computation of cyclic redundancy checks with arbitrary polynomials and a high flexibility, such as updating of checksums after modifying data block parts with a known old checksum.
Key concepts: Checksum, Cyclic redundancy check, Redundancy (engineering), Computer science, Computation, Flexibility (engineering), Software, Parallel computing