Nonlinearity and Kernel of Z-Linear Simplex and MacDonald Codes

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Z2s -additive codes are subgroups of Zn2s , and can be seen as a generalization of linear codes over Z2 and Z4. A Z2s -linear code is a binary code (not necessarily linear) which is the Gray map image of a Z2s -additive code. We consider Z2s -additive simplex codes of type α and β, which are a generalization over Z2s of the binary simplex codes. These codes are related to the Z2s -additive Hadamard codes. In this paper, we use this relationship to find a linear subcode of the corresponding Z2s -linear codes, called kernel, and a representation of these codes as cosets of this kernel. In particular, this also gives the linearity of these codes. Similarly, Z2s -additive MacDonald codes are defined for s>2, and equivalent results are obtained.

Cite

CITATION STYLE

APA

Fernandez-Cordoba, C., Vela, C., & Villanueva, M. (2022). Nonlinearity and Kernel of Z-Linear Simplex and MacDonald Codes. IEEE Transactions on Information Theory, 68(11), 7174–7183. https://doi.org/10.1109/TIT.2022.3172884

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free