Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Bernardo Gabriel Rodrigues"'
Publikováno v:
Journal of Algebra. 585:422-446
We introduce and discuss an elementary tool from representation theory of finite groups for constructing linear codes invariant under a given permutation group G. The tool gives theoretical insight as well as a recipe for computations of generator ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e7f000e46358cf352a5c307cc3304176
https://doi.org/10.1016/j.jalgebra.2021.05.019
https://doi.org/10.1016/j.jalgebra.2021.05.019
Publikováno v:
Glasnik matematički
Volume 56
Issue 1
Volume 56
Issue 1
All non-trivial point and block-primitive 1-(v, k, k) designs 𝓓 that admit the group G = PGL2(q), where q is a power of an odd prime, as a permutation group of automorphisms are determined. These self-dual and symmetric 1-designs are constructed b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::49631193f919bd7a52061776b715d685
https://doi.org/10.3336/gm.56.1.01
https://doi.org/10.3336/gm.56.1.01
Publikováno v:
Communications in Algebra. 49:2707-2721
The exterior degree d∧(G) of a finite group G is the probability that a pair (x, y) of elements x, y chosen uniformly at random in G satisfies x∧y=1∧, where ∧ is the operator of nonabelian exterior...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f7293ba06139e749881d327f2a6c050d
https://doi.org/10.1080/00927872.2021.1881788
https://doi.org/10.1080/00927872.2021.1881788
Publikováno v:
Applicable Algebra in Engineering, Communication and Computing. 34:57-66
For $$m\ge 4$$ even, the duals of p-ary codes, for any prime p, from adjacency matrices for the m-ary 2-cube $$Q^m_2$$ are shown to have subcodes with parameters $$[m^2,2m-2,m]$$ for which minimal PD-sets of size $$\frac{m}{2}$$ are constructed, henc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::73cf86719b9b86f679e80c0034bd5289
https://doi.org/10.1007/s00200-020-00481-5
https://doi.org/10.1007/s00200-020-00481-5
Publikováno v:
Communications in Algebra. 48:5474-5481
Let $ x $ be an element of a finite group $ G $ and denote the order of $ x $ by $ \mathrm{ord}(x) $. We consider a finite group $ G $ such that $ \gcd(\mathrm{ord}(x),\mathrm{ord}(y))\leqslant 2 $ for any two vanishing elements $ x $ and $ y $ conta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e23dacc40b25d02bcdf8961b67d6832b
https://doi.org/10.1080/00927872.2020.1791146
https://doi.org/10.1080/00927872.2020.1791146
Publikováno v:
Advances in Mathematics of Communications. 14:603-611
In this paper, using a method of construction of \begin{document}$ 1 $\end{document} -designs which are not necessarily symmetric, introduced by Key and Moori in [ 5 ], we determine a number of \begin{document}$ 1 $\end{document} -designs with intere
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::88204d440157525a20ee0a839af3de79
https://doi.org/10.3934/amc.2020033
https://doi.org/10.3934/amc.2020033
Autor:
Bernardo Gabriel Rodrigues
Publikováno v:
Applicable Algebra in Engineering, Communication and Computing. 32:113-134
One of the questions of current interest in coding theory is the following: given a finite non-solvable permutation group G acting transitively on a set $$\Omega $$ , under what conditions on G are self-dual codes invariant under G existent or nonexi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a54ab11fca96d3c12cf582e1a0987d9
https://doi.org/10.1007/s00200-019-00404-z
https://doi.org/10.1007/s00200-019-00404-z
Publikováno v:
Discrete Applied Mathematics. 270:106-114
Let G be a finite, connected graph. The eccentricity of a vertex v of G is the distance from v to a vertex farthest from v . The average eccentricity of G is the arithmetic mean of the eccentricities of the vertices of G . It was shown that the avera
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::09d8c429175c7aafe1e6b106df9746d6
https://doi.org/10.1016/j.dam.2019.06.003
https://doi.org/10.1016/j.dam.2019.06.003
Publikováno v:
Journal of Applied Mathematics and Computing. 61:461-479
Codes from adjacency matrices from the Hamming graphs $$H^k(n,m)$$ are examined for the property of being special LCD codes. The special property involves being able to propose a feasible decoding algorithm for the binary codes, and also to deduce th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e325d0e9e5f3a019e01e4108d06878e7
https://doi.org/10.1007/s12190-019-01259-w
https://doi.org/10.1007/s12190-019-01259-w
Publikováno v:
Quaestiones Mathematicae. 43:523-538
For a set Ω = {1, 2, . . . , n} where n = 2k ≥ 6, let Ω{k} denote the set of all subsets of Ω of size k. We examine the binary codes from the row span of biadjacency matrices of bipartite graphs wi...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6feeccfba09b4364417bcb4ad5e3e500
https://doi.org/10.2989/16073606.2019.1580227
https://doi.org/10.2989/16073606.2019.1580227