Counting codes over rings

Abstract

We extend the definition of free codes to codes over local rings and arbitrary Frobenius rings. The number of free codes over finite Frobenius rings is determined by calculating the number for local rings and applying the Chinese Remainder Theorem. A formula for the number of codes of arbitrary type over a finite chain ring is given and this is applied to determine the number of linear codes over a finite principal ideal ring.