Revision history [back]

Is there a method to deal with all codewords over the integr rings Z_n wheren=p^k for a prime p? I know that the linear codes over general rings has yet to be implemented. But at least over prime power integer rings, is it somehow possible to get the codewords? Thanks beforehand.

Is there a method to deal with all codewords over the integr integer rings Z_n wherewhere n=p^k for a prime p? I know that the linear codes over general rings has yet to be implemented. But at least over prime power integer rings, is it somehow possible to get the codewords? Thanks By codeword, I mean a submodule of a free-module over the ring, in this case Z_n.

Specifically, my aim is come with a framework for computing the various parameters of codes over non-field integer rings. A more typical example would be this CCO paper on simplex code. In the paper, the preliminaries (section 2) and the first three theorems describe the simplex codes for the submodule of the free module Z_q^2. Similarly, the sections 3 and 4 give the definitions and generator matrices for unit macdonald and simplex unit macdonald codes over the free module Z_q^k where q and k are any integers. Any hints?Thanks beforehand.