A novel test for unique decipherability of codes

• Autores: János Falucskai
• Localización: Publicationes Mathematicae Debrecen, ISSN 0033-3883, Tomus 78, Fasc. 3-4, 2011, págs. 535-541
• Idioma: inglés
• DOI: 10.5486/pmd.2011.4716
• Texto completo no disponible (Saber más ...)
• Resumen

  • Having a set C of codewords wi we have to decide whether there are two or more sequences of codewords which form the same chain of characters of codewords.

    A code C is UD (uniquely decipherable) code, if every message has at most one factorization with respect to code C, that is, if x1x2 : : : xn = y1y2 : : : ym holds, where x1; x2; : : : ; xn; y1; y2; : : : ; ym 2 C, then n = m and x1 = y1; : : : ; xn = yn. We have developed an algorithm that solves this problem by using nite automata in [?]. In this paper we suppose that there is no empty string in the set of coded messages.

    Thus, we investigate the language C+. In these cases the automata have more states, but we get more applicable results.