Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Felice Manganiello"'
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 32:1452-1464
A broad range of scientific simulations involve solving large-scale computationally expensive linear systems of equations. Iterative solvers are typically preferred over direct methods when it comes to large systems due to their lower memory requirem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3251f093b5a5c8c6ce512c320c498d94
https://doi.org/10.1109/tpds.2021.3052091
https://doi.org/10.1109/tpds.2021.3052091
Publikováno v:
Cryptography and Coding ISBN: 9783030926403
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0cb72f2e2983183e6491cea5566e144
https://doi.org/10.1007/978-3-030-92641-0_1
https://doi.org/10.1007/978-3-030-92641-0_1
Publikováno v:
Finite Fields and Their Applications. 67:101731
Let p be an odd prime and consider the finite field F p 2 . Given a linear code C ⊂ F p 2 n , we use algebraic number theory to construct an associated lattice Λ C ⊂ O L n for L an algebraic number field and O L the ring of integers of L. We att
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::efe6a53c644fa46d0aad6cfd4326e7cb
https://doi.org/10.1016/j.ffa.2020.101731
https://doi.org/10.1016/j.ffa.2020.101731
Publikováno v:
Journal of Algebra Combinatorics Discrete Structures and Applications, Vol 5, Iss 3 (2018)
Batch codes, introduced by Ishai et al., encode a string $x \in \Sigma^{k}$ into an $m$-tuple of strings, called buckets. In this paper we consider multiset batch codes wherein a set of $t$-users wish to access one bit of information each from the or
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::478a26159f243f2e7e38a4eac8aaa2a4
http://jacodesmath.com/index.php/jacodesmath/article/view/168
http://jacodesmath.com/index.php/jacodesmath/article/view/168
A linear code C with the property that C ∩ C ⊥ = { 0 } is said to be a linear complementary dual, or LCD, code. In this paper, we consider generalized affine Cartesian codes which are LCD. Generalized affine Cartesian codes arise naturally as the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5f06f59dbca287660779c722b5bbb679
Autor:
Nathan Kaplan, Hiram H. López, Wael Halbawi, Sarah E. Anderson, Emina Soljanin, Felice Manganiello, Judy L. Walker
Publikováno v:
Association for Women in Mathematics Series ISBN: 9783319639307
We approach the problem of linear network coding for multicast networks from different perspectives. We introduce the notion of the coding points of a network, which are edges of the network where messages combine and coding occurs. We give an intege
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c55f193c4a94a5e4f825f4794ce65041
https://doi.org/10.1007/978-3-319-63931-4_1
https://doi.org/10.1007/978-3-319-63931-4_1
Autor:
Felice Manganiello, Travis Baumbaugh
A skew polynomial ring $R=K[x;\sigma,\delta]$ is a ring of polynomials with non-commutative multiplication. This creates a difference between left and right divisibility, and thus a concept of left and right evaluations and roots. A polynomial in suc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3bccef5917045e075195885c8ebb8188
Publikováno v:
Finite Fields and Their Applications
A spread code is a set of vector spaces of a fixed dimension over a finite field Fq with certain properties used for random network coding. It can be constructed in different ways which lead to different decoding algorithms. In this work we present a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7b5c2d0b93a19ae1e34303624738b202
https://doi.org/10.1016/j.ffa.2013.08.002
https://doi.org/10.1016/j.ffa.2013.08.002
Publikováno v:
IEEE Transactions on Information Theory. 59:7386-7404
In network coding a constant dimension code consists of a set of k-dimensional subspaces of F_q^n. Orbit codes are constant dimension codes which are defined as orbits of a subgroup of the general linear group, acting on the set of all subspaces of F
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ec9573fa53cae18a1e5dd0318f853e29
https://doi.org/10.1109/tit.2013.2274266
https://doi.org/10.1109/tit.2013.2274266
Over a finite field $\mathbb{F}_{q^m}$, the evaluation of skew polynomials is intimately related to the evaluation of linearized polynomials. This connection allows one to relate the concept of polynomial independence defined for skew polynomials to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b246e81510c341e6f7c67dec9fbbf218
http://arxiv.org/abs/1610.07724
http://arxiv.org/abs/1610.07724