abstract. we develop refinements of the levenshtein bound in q-ary hamming spaces
by taking into account the discrete nature of the distances versus the continuous behavior of certain parameters used by levenshtein. the first relevant cases are investigated
in detail and new bounds are presented. in particular, we derive generalizations and
q-ary analogs of a maceliece bound. we provide evidence that our approach is as
good as the complete linear programming and discuss how faster are our calculations.
finally, we present a table with parameters of codes which, if exist, would attain our
bounds.