Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Juan Jacobo Simón"'
Autor:
José Joaquín Bernal, Juan Jacobo Simón
Publikováno v:
Finite Fields and Their Applications. 88:102182
In this paper we describe a variation of the classical permutation decoding algorithm that can be applied to any affine-invariant code with respect to certain type of information sets. In particular, we can apply it to the family of first-order Reed-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::209a63ae7dc38776459e1a9357d97a62
https://doi.org/10.1016/j.ffa.2023.102182
https://doi.org/10.1016/j.ffa.2023.102182
Publikováno v:
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
Recently E.R. Alvares, M.M. Alves and M.J. Redondo introduced a cohomology for a group G with values in a module over the partial group algebra K par ( G ) , which is different from the partial group cohomology defined earlier by the first two named
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7f1180554b44946166e0f8de56293012
https://doi.org/10.1016/j.jalgebra.2019.11.009
https://doi.org/10.1016/j.jalgebra.2019.11.009
Publikováno v:
Mathematics in Computer Science. 14:415-421
In this note, we apply some techniques developed in Bernal et al. (IEEE Trans Inf Theory 62(2):655–668, 2016; Adv Math Commun 10:459–474, 2016; IEEE Trans Inf Theory 2018. https://doi.org/10.1109/TIT.2018.2868446) to give a particular constructio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce9ab55239e59570b67abed5e0c5829e
https://doi.org/10.1007/s11786-019-00416-5
https://doi.org/10.1007/s11786-019-00416-5
Publikováno v:
IEEE Transactions on Information Theory. 65:1752-1763
In this paper, we develop a technique to extend any bound for the minimum distance of cyclic codes constructed from its defining sets (ds-bounds) to Abelian (or multivariate) codes through the notion of ${\mathbb B}$ -apparent distance. We also study
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::34c300b4179b5889805650cadcd3a671
https://doi.org/10.1109/tit.2018.2868446
https://doi.org/10.1109/tit.2018.2868446
Autor:
José Joaquín Bernal, Juan Jacobo Simón
Publikováno v:
Arithmetic of Finite Fields ISBN: 9783030688684
WAIFI
WAIFI
We deal with two problems related with the use of the Sakata’s algorithm in a specific class of bivariate codes (see [2, 8, 9]). The first one is to improve the general framework of locator decoding in order to apply it on such abelian codes. The s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bcc46f953e63c01290a0e4cd0e45d45e
https://doi.org/10.1007/978-3-030-68869-1_7
https://doi.org/10.1007/978-3-030-68869-1_7
Publikováno v:
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
We study the relations between partial and global group cohomology with values in a commutative unital ring $\mathcal{A}$. In particular, for a unital partial action of a group $G$ on $\mathcal{A}$, such that $\mathcal{A}$ is a direct product of comm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7d137211e6b68bb9f3fd9da42a7e4250
Publikováno v:
Advances in Mathematics of Communications. 10:459-474
In this paper we study the family of cyclic codes such that its minimum distance reaches the maximum of its BCH bounds. We also show a way to construct cyclic codes with that property by means of computations of some divisors of a polynomial of the f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a15db168c01b33e80c2e9762f045a3af
https://doi.org/10.3934/amc.2016018
https://doi.org/10.3934/amc.2016018
Publikováno v:
IEEE Transactions on Information Theory. 62:655-668
This paper is devoted to studying two main problems: 1) computing the apparent distance of an Abelian code and 2) giving a notion of Bose, Ray-Chaudhuri, Hocquenghem (BCH) multivariate code. To do this, we first strengthen the notion of an apparent d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f302b91e594ebae43be52df83b495904
https://doi.org/10.1109/tit.2015.2512594
https://doi.org/10.1109/tit.2015.2512594
Autor:
Mikhailo Dokuchaev, Juan Jacobo Simón
Publikováno v:
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
We prove that if two finite groups G1 and G2 admit an isomorphism between their lattices of subgroups which preserves subgroup rings over a commutative ring K then the partial group rings Kpar G1 and Kpar G2 are isomorphic. If |G| is odd, then we fin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::57462c9960ec6fc7b286df1038a39f55
https://doi.org/10.1080/00927872.2014.975348
https://doi.org/10.1080/00927872.2014.975348
Publikováno v:
Transactions of the American Mathematical Society. 368:4957-4992
We consider a large class of partial actions of groups on rings, called regular, which contains all s-unital partial actions, as well as all partial actions on C∗-algebras. For them the notion of Morita equivalence is introduced, and it is shown th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d7046c4685280ce3f8a974ad56feda61
https://doi.org/10.1090/tran/6525
https://doi.org/10.1090/tran/6525