Abstract
The construction of thin maximal bifix codes of degree 1 or 2 is clear and simple. In this paper, a class of thin maximal bifix codes of degree 3 which contains all finite maximal bifix codes of degree 3 is investigated. The construction of such codes is determined. It is well known that for any positive integers d and k, there are finitely many finite maximal bifix codes of degree d over a k-letter alphabet. But the enumeration problem is unsolved in general. In this paper, we show that for any positive integer k, there is a bijection from the set of all finite maximal bifix codes of degree 3 over a k-letter alphabet onto the set of all directed acyclic graphs with k vertices, and then, the enumeration problem of finite maximal bifix codes of degree 3 is solved.
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 callMore From: Bulletin of the Malaysian Mathematical Sciences Society
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.
