Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Fabio Pasticci"'
Publikováno v:
Graphs and Combinatorics. 29:883-892
1-Factorizations of the complete graph K n embedded in a finite Desarguesian projective plane PG(2, q), q even, are hyperfocused arcs of size n. The classification of hyperfocused arcs is motivated by applications to 2-level secret sharing schemes. S
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b23651b344a04b065880197583636512
https://doi.org/10.1007/s00373-012-1166-y
https://doi.org/10.1007/s00373-012-1166-y
Publikováno v:
Advances in Mathematics of Communications. 6:121-130
It is proved that for every integer n = 2(k) - 1, with k >= 5, there exists a perfect code C of length n, of rank r = n - log(n + 1) + 2 and with a trivial symmetry group. This result extends an ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af7b524077563dcdee7d9957cc4b3615
https://doi.org/10.3934/amc.2012.6.121
https://doi.org/10.3934/amc.2012.6.121
Autor:
Fabio Pasticci, Thomas Westerbäck
Publikováno v:
Discrete Mathematics. 309:2763-2774
Mixed perfect 1-error correcting codes and the associated dual codes over the group Z(n,l), Z(n,l)=Z"2xZ"2x...xZ"2@?nxZ2l,n>=1 and l>=2, are investigated. A lower and an upper bound for the rank k of the kernel of mixed perfect 1-error correcting cod
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cc87ed7a08e5a2c417ee8393a0541661
https://doi.org/10.1016/j.disc.2008.06.037
https://doi.org/10.1016/j.disc.2008.06.037
Publikováno v:
Advances in Mathematics of Communications. 3:295-309
The set of permutations of the coordinate set that maps a perfect code $C$ into itself is called the symmetry group of $C$ and is denoted by Sym$(C)$. It is proved that for all integers $n=2^m-1$, where $m=4,5,6,...$, and for any integer $r$, where $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e72fd808d348f7b41e34613db4e2f6b9
https://doi.org/10.3934/amc.2009.3.295
https://doi.org/10.3934/amc.2009.3.295
Autor:
Massimo Giulietti, Fabio Pasticci
Publikováno v:
IEEE Transactions on Information Theory. 53:1928-1935
Some new infinite families of short quasi-perfect linear codes are described. Such codes provide improvements on the currently known upper bounds on the minimal length of a quasi-perfect [n,n-m,4]q-code when either 1) q=16, m ges 5, m odd, or 2) q=2i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b072ac4374a8b6d201fc9ea0123c677
https://doi.org/10.1109/tit.2007.894688
https://doi.org/10.1109/tit.2007.894688
Autor:
Giorgio Faina, Fabio Pasticci
Cyclic curves, i.e. curves fixed by a cyclic collineation group, play a central role in the investigation of cyclic arcs in Desarguesian projective planes. In this paper, the genus of a cyclic curve arising from a cyclic k -arc of Singer type is comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::67ff71b0194e4980a11fb3bb44e3a410
http://hdl.handle.net/11391/1385266
http://hdl.handle.net/11391/1385266
Autor:
Fabio Pasticci, Massimo Giulietti
Publikováno v:
Finite Fields and Their Applications. (4):988-1000
Complete n-tracks in PG(N,q) and non-extendable Near MDS codes of dimension N+1 over Fq are known to be equivalent objects. The best known lower bound for the maximum number of points of an n-track is attained by elliptic n-tracks, that is, n-tracks
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::438065591e996324bd18e139ca7cf13e