Carlos Vela

activity

20182024

Z_{2^{s}}

-Linear Simplex and MacDonald Codes

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing cs.ITShow all

4 papers · 1 filter

cs.IT2024

Computing efficiently a parity-check matrix for Zps-additive codes

Cristina Fernández-Córdoba, Adrián Torres, Carlos Vela +1

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 m…

cs.IT2022

Equivalences among Z_{p^s}-linear Generalized Hadamard Codes

Dipak K. Bhunia, Cristina Fernández-Córdoba, Carlos Vela +1

The $Z_{p^{s}}$ -additive codes of length $n$ are subgroups of $Z_{p^{s}}^{n}$ , and can be seen as a generalization of linear codes over $Z_{2}$ , $Z_{4}$ , or $Z_{2^{s}}$ in general. A $\Z_…

cs.IT2019★ 1 cited

On the Kernel of $Z_{2^{s}}$ -Linear Simplex and MacDonald Codes

Cristina Fernández-Córdoba, Carlos Vela, Mercè Villanueva

The $Z_{2^{s}}$ -additive codes are subgroups of $Z_{2^{s}}^{n}$ , and can be seen as a generalization of linear codes over $Z_{2}$ and $Z_{4}$ . A $Z_{2^{s}}$ -linear code is a binary code w…

cs.IT2018

On the Kernel of $Z_{2^{s}}$ -Linear Hadamard Codes

Cristina Fernández-Córdoba, Carlos Vela, Mercè Villanueva

The $Z_{2^{s}}$ -additive codes are subgroups of $Z_{2^{s}}^{n}$ , and can be seen as a generalization of linear codes over $Z_{2}$ and $Z_{4}$ . A $\mathbb{…

Computing efficiently a parity-check matrix for Zps-additive codes

Equivalences among Z_{p^s}-linear Generalized Hadamard Codes

On the Kernel of Z2s​-Linear Simplex and MacDonald Codes

On the Kernel of Z2s​-Linear Hadamard Codes

On the Kernel of $Z_{2^{s}}$ -Linear Simplex and MacDonald Codes

On the Kernel of $Z_{2^{s}}$ -Linear Hadamard Codes