Abstract
We study how the concept of bounded synchronization delay is related to retrograde comma-free codes. Retrograde codes are a subclass of comma-free codes in which the dictionary of code words excludes not only overlaps of code words but also reversals of overlaps. We give a general upper bound on the maximum size of a retrograde comma-free distionary, provide a construction for a bounded synchronization delay retrograde code which attains this maximum size, and discuss traditional dictionaries in the context of retrograde codes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
