An efficient algorithm is presented for encoding unconstrained informa
tion sequences into a third-order spectral-null code of length n and r
edundancy theta log(2) n + O(log log n). The encoding can be implement
ed using O(n) integer additions and O(n log n) counter increments.