On ℤprℤps-additive codes
Authors:
- 14 July 2014
- journal article
- research article
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 63 (10) , 2089-2102
Abstract
In this paper, we study the algebraic structure of -additive codes which are -submodules where is prime, and and are positive integers. -additive codes naturally generalize and -additive codes which have been introduced recently. The results obtained in this work generalize a great amount of the studies done on additive codes. Especially, we determine the standard forms of generator and parity-check matrices for this family of codes. This leads to the identification of the type and the cardinalities of these codes. Furthermore, we present some bounds on the minimum distance and examples that attain these bounds. Finally, we present some illustrative examples for some special cases.Keywords
This publication has 11 references indexed in Scilit:
- On ℤ2ℤ2[u]-additive codesInternational Journal of Computer Mathematics, 2014
- The Structure of Z2Z2s-Additive Codes: Bounds on the Minimum DistanceApplied Mathematics & Information Sciences, 2013
- Maximum distance separable codes over ${\mathbb{Z}_4}$ and ${\mathbb{Z}_2 \times \mathbb{Z}_4}$Designs, Codes and Cryptography, 2010
- ${{{\mathbb Z}_2}{{\mathbb Z}_4}}$ -linear codes: generator matrices and dualityDesigns, Codes and Cryptography, 2009
- Maximum distance codes over rings of order 4IEEE Transactions on Information Theory, 2001
- Association schemes and coding theoryIEEE Transactions on Information Theory, 1998
- Z/sub 2/k-linear codesIEEE Transactions on Information Theory, 1998
- Translation-invariant propelinear codesIEEE Transactions on Information Theory, 1997
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codesIEEE Transactions on Information Theory, 1994
- Maximum distanceq-nary codesIEEE Transactions on Information Theory, 1964