Abstract

The notions of $$k$$k-comma codes and $$k$$k-comma intercodes are proper generalizations of comma-free codes and intercodes respectively. In this paper, we characterize $$k$$k-comma codes and $$k$$k-comma intercodes by using infix codes and bifix codes. Then, we consider the homomorphism which preserves $$k$$k-comma codes and $$k$$k-comma intercodes.

Full Text
Paper version not known

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 call

Disclaimer: 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.