Abstract
Decipherability conditions for codes are investigated by using the approach of Guzman, who introduced in [7] the notion of variety of codes and established a connection between classes of codes and varieties of monoids. The class of Uniquely Decipherable (UD) codes is a special case of variety of codes, corresponding to the variety of all monoids. It is well known that the Kraft inequality is a necessary condition for UD codes, but it is not sufficient, in the sense that there exist codes that are not UD and that satisfy the Kraft inequality. The main result of the present paper states that, given a variety V of codes, if all the elements of V satisfy the Kraft inequality, then V is the variety of UD codes. Thus, in terms of varieties, Kraft inequality characterizes UD codes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Burderi, F., Restivo, A. Varieties of Codes and Kraft Inequality. Theory Comput Syst 40, 507–520 (2007). https://doi.org/10.1007/s00224-006-1320-0
Issue Date:
DOI: https://doi.org/10.1007/s00224-006-1320-0