Abstract
The concepts of unique decipherability (UD), multiset decipherability (MSD), and set decipherability (SD) of codes were developed to handle some special problems in the transmission of information. In unique decipherability, different sequences of codewords carry different information. In multiset decipherability, the information of interest is the multiset of codewords used in the encoding process so that order in which transmitted words are received is immaterial. In set decipherability, it is the set of codewords that is relevant information so the order and the multiplicity of words are immaterial. Lempel (1986) showed that the UD and MSD properties coincide for two-word codes and conjectured that every three-word MSD code is a UD code. Guzman (1995) showed that the UD, MSD, and SD properties coincide for two-word codes and conjectured that these properties coincide for three-word codes. In this paper, we answer both conjectures positively for all three-word codes {C/sub 1/, C/sub 2/, C/sub 3/} satisfying |C/sub 1/|=|C/sub 2/|/spl les/|C/sub 3/|. Our procedures are based on techniques related to dominoes.
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.
