Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Baumbaugh, Travis"'
Affine Cartesian codes are defined by evaluating multivariate polynomials at a cartesian product of finite subsets of a finite field. In this work we examine properties of these codes as batch codes. We consider the recovery sets to be defined by poi
Externí odkaz:
http://arxiv.org/abs/2005.07577
Autor:
Baumbaugh, Travis, Diaz, Yariana, Friesenhahn, Sophia, Manganiello, Felice, Vetter, Alexander
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 ori
Externí odkaz:
http://arxiv.org/abs/1710.07386
Autor:
Baumbaugh, Travis, Manganiello, Felice
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:
http://arxiv.org/abs/1706.04283
Autor:
Baumbaugh, Travis1 (AUTHOR) tbaumba@clemson.edu, Manganiello, Felice1 (AUTHOR) manganm@clemson.edu
Publikováno v:
Journal of Discrete Mathematical Sciences & Cryptography. May2019, Vol. 22 Issue 3, p377-389. 13p.
Autor:
Baumbaugh, Travis, Diaz, Yariana, Friesenhahn, Sophia, Manganiello, Felice, Vetter, Alexander
Publikováno v:
Journal of Algebra Combinatorics Discrete Structures & Applications; 2018, Vol. 5 Issue 3, p153-165, 13p