- there is a fixed frame length k
- the last m bits in a frame are a checksum
- the checksum is formed by a (possibly non-linear) combination of the first k-m bits in the frame
- there are no collisions between checksums, i.e., that a given sequence of k-m data bits always map onto the same checksum
Suppose that we only know that the data consist of frames of 14 bits where the last two bits are a checksum but not know how the checksum is formed and where the frames start. Then a search for the presence of such frames results in the plot below using test_checksum.m
This method can be easily generalized for checksums which are formed using bits both from the present and from the previous frame, e.g., the GPS navigation message, see 184.108.40.206 in IS-GPS-200H.