.png){kind=icon}
Return
Efficient encoding algorithm for second-order spectral-null codes using cyclic bit shift
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2007.70849.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
second-order spectral-null code
high-order spectral-null code
balanced code
1-EC/AUED code
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSave
View more