|
Journal of Automata, Languages and Combinatorics
formerly:
Journal of Information Processing and Cybernetics /
Elektronische Informationsverarbeitung und Kybernetik
|
|
@article{jalc040403,
author = {Madonia, Maria and Salemi, Sergio and Sportelli, Tecla},
title = {Covering Submonoids and Covering Codes},
journal = jalc,
year = 1999,
volume = 4,
number = 4,
pages = {333--350},
keywords = {codes, string covering, covering codes},
abstract = {This paper deals with the formalization of the intuitive
notion of covering monoid and the investigation of the
related algebraic properties. It is shown that covering
monoids can be regarded as a generalization of the well
known classical monoids and z-monoids. A new coding notion
is introduced and a simple method to decide whether a finite
set~$X$ of words is a covering code is described. Finally,
the case in which $X$ is an uniform set, i.\,e.\ a set whose
elements are all of the same length, is analyzed.}
}