If Ai is finite alphabet for i=1,...,n, the Manhattan distance is
defined in ∏i=1nAi. A grid code is introduced as a subset of
∏i=1nAi. Alternative versions of the Hamming and
Gilbert-Varshamov bounds are presented for grid codes. If Ai is a cyclic
group for i=1,...,n, some bounds for the minimum Manhattan distance of codes
that are cyclic subgroups of ∏i=1nAi are determined in terms of
their minimum Hamming and Lee distances. Examples illustrating the main results
are provided