The Zps-additive codes of length n are subgroups of Zps^n , and can be seen as a generalization of linear codes over Z2, Z4, or more general over Z2s . In this paper, we show two methods for computing a parity-check matrix of a Zps-additive code from a generator matrix of the code in standard form. We also compare the performance of our results implemented in Magma with the current available function in Magma for codes over finite rings in general. A time complexity analysis is also shown.

翻译：Zps-加法码是长度为n的Zps^n的子群，可视为Z2、Z4或更一般的Z2s上线性码的推广。本文展示了两种从标准型生成矩阵计算Zps-加法码奇偶校验矩阵的方法。我们还通过Magma实现将所提方法的性能与Magma中现有的一般有限环上编码函数进行了比较，并给出了时间复杂度分析。