|
Journal of Automata, Languages and Combinatorics
formerly:
Journal of Information Processing and Cybernetics /
Elektronische Informationsverarbeitung und Kybernetik
|
|
@article{jalc040204,
author = {De Felice, Clelia},
title = {Haj\'{o}s Factorizations of Cyclic Groups -- A Simpler
Proof of a Characterization},
journal = jalc,
year = 1999,
volume = 4,
number = 2,
pages = {111--116},
keywords = {variable-length codes, finite maximal codes,
factorizations of finite cyclic groups},
abstract = {A pair $(T,R)$ of subsets of a finite abelian group $G$
is a factorization of $G$ if $G$ is the direct sum of $T$
and $R$. A class of factorizations of finite cyclic groups
were described by {\sc Haj\'{o}s} and a new characterization
of these factorizations arose in the framework of the theory
of variable-length codes. In this note we will give a
simpler proof of this characterization.}
}