The Science and Information (SAI) Organization
  • Home
  • About Us
  • Journals
  • Conferences
  • Contact Us

Publication Links

  • IJACSA
  • Author Guidelines
  • Publication Policies
  • Metadata Harvesting (OAI2)
  • Digital Archiving Policy
  • Promote your Publication

IJACSA

  • About the Journal
  • Call for Papers
  • Author Guidelines
  • Fees/ APC
  • Submit your Paper
  • Current Issue
  • Archives
  • Indexing
  • Editors
  • Reviewers
  • Apply as a Reviewer

IJARAI

  • About the Journal
  • Archives
  • Indexing & Archiving

Special Issues

  • Home
  • Archives
  • Proposals
  • Guest Editors

Future of Information and Communication Conference (FICC)

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Computing Conference

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Intelligent Systems Conference (IntelliSys)

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Future Technologies Conference (FTC)

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact
  • Home
  • Call for Papers
  • Guidelines
  • Fees
  • Submit your Paper
  • Current Issue
  • Archives
  • Indexing
  • Editors
  • Reviewers
  • Subscribe

Article Details

Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.

L-Bit to M-Bit Code Mapping

Author 1: Ruixing Li
Author 2: Shahram Latifi
Author 3: Yun Lun
Author 4: Ming Lun

Download PDF

Digital Object Identifier (DOI) : 10.14569/IJACSA.2015.061116

Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 6 Issue 11, 2015.

  • Abstract and Keywords
  • How to Cite this Article
  • {} BibTeX Source

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.

Keywords: overhead; mapping; synchronization; consecutive “0”

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}
}


IJACSA

Upcoming Conferences

Future of Information and Communication Conference (FICC) 2023

2-3 March 2023

  • Virtual

Computing Conference 2023

22-23 June 2023

  • London, United Kingdom

IntelliSys 2023

7-8 September 2023

  • Amsterdam, The Netherlands

Future Technologies Conference (FTC) 2023

2-3 November 2023

  • San Francisco, United States
The Science and Information (SAI) Organization
BACK TO TOP

Computer Science Journal

  • About the Journal
  • Call for Papers
  • Submit Paper
  • Indexing

Our Conferences

  • Computing Conference
  • Intelligent Systems Conference
  • Future Technologies Conference
  • Communication Conference

Help & Support

  • Contact Us
  • About Us
  • Terms and Conditions
  • Privacy Policy

© The Science and Information (SAI) Organization Limited. Registered in England and Wales. Company Number 8933205. All rights reserved. thesai.org