Sampling theorem in Walsh-Fourier analysis

A sampling theorem for sequency-limited functions is proved. It is shown that the reconstruction procedure is trivially simple when the signal is sampled at a rate 2Z, where Z is of the form 2k, k integer, equal to, or greater than, the sequency bandwidth in zeros/s. Harmuth´s contention that the rate 2Z is sufficient for any Z is thus shown to be invalid for this type of reconstruction.