College of Nyíregyháza
Abstract: Our goal is to show the equivalence between two algorithms concerning uniquely decipherable codes. We show an automaton that solves this problem, and we define remainders for the states of automaton. Finally we show that remainders compose the sets of the algorithm of Sardinas-Patterson.
Keywords: Uniquely decipherable codes, automata, length-variable codes, Sardinas-Patterson algorithm.
Classification (MSC2000): 94B35; 94A45, 68Q45
Full text of the article: