Abstract
Multivalued encodings constitute an interesting generalization of ordinary encodings in that they allow each source symbol to be encoded by more than one codeword. In this paper the problem of testing the property of unique decipherability of multivalued encodings is considered. We provide an efficient algorithm whose time complexity is O(| C|Δ), where | C| is the number of codewords and Δ is the sum of their lengths. It is remarkable that the running time equals that of the fastest algorithms for testing the much simpler property of unique decipherability of ordinary encodings.
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.
