Abstract
We introduce a new notion of modular independence to define bases and the generator matrices for the codes over the ring of integers \({\mathbb {Z}_m}\) of general modulus m. We define standard forms for such generator matrices, and discuss how to find such forms and the parity check matrices.
Similar content being viewed by others
References
Bannai E., Dougherty S.T., Harada M., Oura M.: Type II codes, even unimodular lattices, and invariant rings. IEEE Trans. Inform. Theory 45(4), 1194–1205 (1999)
Calderbank A.R., Sloane N.J.A.: Modular and p-adic cyclic codes. Des. Codes Cryptogr. 6, 21–35 (1995)
Dougherty S.T., Shiromoto K.: MDR codes over Z k . IEEE Trans. Inform. Theory 46(1), 265–269 (2000)
Dougherty S.T., Harada M., Sole P.: Self-dual codes over rings and the Chinese Remainder Theorem. Hokkaido Math. J. 28, 253–283 (1999)
Lang S.: Algebra. Addison-Wesley, Reading (1993)
Norton G.H., Salagean A.: On the structure of linear and cyclic codes over a finite chain. AAECC 10, 489–506 (2000)
Rains E., Sloane N.J.A.: Self-dual codes. In: Pless, V.S., Huffman, W.C.(eds) Handbook of Coding Theory, pp. 177–294. Elsevier, Amsterdam (1998)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by E. Bannai.
Rights and permissions
About this article
Cite this article
Park, Y.H. Modular independence and generator matrices for codes over \({\mathbb {Z}_m}\) . Des. Codes Cryptogr. 50, 147–162 (2009). https://doi.org/10.1007/s10623-008-9220-8
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-008-9220-8