Abstract: We investigate codes that map L bits to m bits to achieve a set of codewords which contain no consecutive n “0”s. Such codes are desirable in the design of line codes which, in the absence of clock information in data, provide reasonable clock recovery due to sufficient state changes. Two problems are tackled- (i) we derive n_min for a fixed L and m and (ii) determine m_min for a fixed L and n. Results benefit telecommunication applications where clock synchronization of received data needs to be done with minimum overhead.

Ruixing Li, Shahram Latifi, Yun Lun and Ming Lun, “L-Bit to M-Bit Code Mapping” International Journal of Advanced Computer Science and Applications(IJACSA), 6(11), 2015. http://dx.doi.org/10.14569/IJACSA.2015.061116

@article{Li2015,
title = {L-Bit to M-Bit Code Mapping},
journal = {International Journal of Advanced Computer Science and Applications}
doi = {10.14569/IJACSA.2015.061116},
url = {http://dx.doi.org/10.14569/IJACSA.2015.061116},
year = {2015},
publisher = {The Science and Information Organization},
volume = {6},
number = {11},
author = {Ruixing Li and Shahram Latifi and Yun Lun and Ming Lun},
}