Abstract
It has been shown that in the free monoid X * generated by X with embedding order, any subset H of incomparable elements of X * is finite. We call such a finite subset H a hypercode. We show that every hypercode is a code and in fact the class of all hypercodes is a proper subclass of the class of prefix codes. In this paper we give some characterizations of hypercodes and study some algebraic properties of the class of all hypercodes.
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.
