In coding theory, the (minimum) distance of a code is a very important invariant, which always determines the error-correcting capability of the code. Let R be an arbitrary commutative finite chain ring, a is a generator of the unique maximal ideal and R* is the multiplicative group of units of R. In this paper, for any w ∈ R*, by using the generator polynomials of (1+aw)-constacyclic codes of
... [Show full abstract] any length over R, higher torsion codes of such codes are calculated. The Hamming distance of all (1+aw)-constacyclic codes of any length over R is determined and the exact homogeneous distance of some such codes is obtained. The result provides a theoretical basis for encoding and decoding for such constacyclic codes.