Efficient Encoding Algorithm for Second-Order Spectral-Null Codes Using Cyclic Bit Shift

Some efficient second-order spectral-null codes encoded an index of the random walk function recursively and ended with the short base second-order spectral-null codes. All of these codes used the Tallini-Bose random walk function that exchanges two consecutive bits. In this paper, we propose a new random walk function based on cyclic bit-shift, on which the redundancy can be improved. Moreover, the bit-shift can be implemented efficiently by either software or hardware.