Zobrazeno 1 - 10
of 80
pro vyhledávání: '"Borges, Joaquim"'
In two previous papers we constructed new families of completely regular codes by concatenation methods. Here we determine cases in which the new codes are completely transitive. For these cases we also find the automorphism groups of such codes. For
Externí odkaz:
http://arxiv.org/abs/2303.11190
Linear complementary dual codes were defined by Massey in 1992, and were used to give an optimum linear coding solution for the two user binary adder channel. In this paper, we define the analog of LCD codes over fields in the ambient space with mixe
Externí odkaz:
http://arxiv.org/abs/1903.07886
We introduce the Hadamard full propelinear codes that factorize as direct product of groups such that their associated group is $C_{2t}\times C_2$. We study the rank, the dimension of the kernel, and the structure of these codes. For several specific
Externí odkaz:
http://arxiv.org/abs/1808.08747
Autor:
Borges, Joaquim
We prove that the class of $\Z_2\Z_2[u]$-linear codes is exactly the class of $\Z_2$-linear codes with automorphism group of even order. Using this characterization, we give examples of known codes, e.g. perfect codes, which has a nontrivial $\Z_2\Z_
Externí odkaz:
http://arxiv.org/abs/1611.05655
Let ${\cal C}$ be a ${\mathbb{Z}}_2{\mathbb{Z}}_4$-additive code of length $n > 3$. We prove that if the binary Gray image of ${\cal C}$, $C=\Phi({\cal C})$, is a 1-perfect nonlinear code, then ${\cal C}$ cannot be a ${\mathbb{Z}}_2{\mathbb{Z}}_4$-cy
Externí odkaz:
http://arxiv.org/abs/1510.06166
A binary linear code $C$ is a $\mathbb{Z}_2$-double cyclic code if the set of coordinates can be partitioned into two subsets such that any cyclic shift of the coordinates of both subsets leaves invariant the code. These codes can be identified as su
Externí odkaz:
http://arxiv.org/abs/1410.5604
A ${\mathbb{Z}}_2{\mathbb{Z}}_4$-additive code ${\cal C}\subseteq{\mathbb{Z}}_2^\alpha\times{\mathbb{Z}}_4^\beta$ is called cyclic if the set of coordinates can be partitioned into two subsets, the set of ${\mathbb{Z}}_2$ and the set of ${\mathbb{Z}}
Externí odkaz:
http://arxiv.org/abs/1406.4425
An alternative permutation decoding method is described which can be used for any binary systematic encoding scheme, regardless whether the code is linear or not. Thus, the method can be applied to some important codes such as Z2Z4-linear codes, whic
Externí odkaz:
http://arxiv.org/abs/1303.3737
We characterize all linear $q$-ary completely regular codes with covering radius $\rho=2$ when the dual codes are antipodal. These completely regular codes are extensions of linear completely regular codes with covering radius 1, which are all classi
Externí odkaz:
http://arxiv.org/abs/1002.4510