Issue No. 07 - July (2008 vol. 57)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2007.70849
Some efficient second-order spectral-null codes encoded an index of random walk function recursively and ended with the short base second-order spectral-null codes. All 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.
Second-order spectral-null code, High-order spectral-null code, Balanced code, 1-EC/AUED code.
Ching-Nung Yang, "Efficient Encoding Algorithm for Second-Order Spectral-Null Codes Using Cyclic Bit Shift", IEEE Transactions on Computers, vol. 57, no. , pp. 876-888, July 2008, doi:10.1109/TC.2007.70849