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.

[全文传递流程]：

一般上传文献全文的时限在1个工作日内